SherbyNet - /page/wikibook/entry.mu

Micron Document

<!DOCTYPE html>

<title>Control flow</title>

</head>

Control flow

</h1>

</header>

/* start https://en.wikipedia.org/ */

.mw-parser-output .hatnote{font-style:italic}.mw-parser-output div.hatnote{padding-left:1.6em;margin-bottom:0.5em}.mw-parser-output .hatnote i{font-style:normal}.mw-parser-output .hatnote+link+.hatnote{margin-top:-0.5em}@media print{body.ns-0 .mw-parser-output .hatnote{display:none!important}}

/* end https://en.wikipedia.org/ */

</style><div role="note" class="hatnote navigation-not-searchable">Not to be confused with <a href="Flow_control_(data)" title="Flow control (data)">Flow control (data)</a>.</div>

/* start https://en.wikipedia.org/ */

.mw-parser-output .hlist dl,.mw-parser-output .hlist ol,.mw-parser-output .hlist ul{margin:0;padding:0}.mw-parser-output .hlist dd,.mw-parser-output .hlist dt,.mw-parser-output .hlist li{margin:0;display:inline}.mw-parser-output .hlist.inline,.mw-parser-output .hlist.inline dl,.mw-parser-output .hlist.inline ol,.mw-parser-output .hlist.inline ul,.mw-parser-output .hlist dl dl,.mw-parser-output .hlist dl ol,.mw-parser-output .hlist dl ul,.mw-parser-output .hlist ol dl,.mw-parser-output .hlist ol ol,.mw-parser-output .hlist ol ul,.mw-parser-output .hlist ul dl,.mw-parser-output .hlist ul ol,.mw-parser-output .hlist ul ul{display:inline}.mw-parser-output .hlist .mw-empty-li{display:none}.mw-parser-output .hlist dt::after{content:": "}.mw-parser-output .hlist dd::after,.mw-parser-output .hlist li::after{content:" · ";font-weight:bold}.mw-parser-output .hlist dd:last-child::after,.mw-parser-output .hlist dt:last-child::after,.mw-parser-output .hlist li:last-child::after{content:none}.mw-parser-output .hlist dd dd:first-child::before,.mw-parser-output .hlist dd dt:first-child::before,.mw-parser-output .hlist dd li:first-child::before,.mw-parser-output .hlist dt dd:first-child::before,.mw-parser-output .hlist dt dt:first-child::before,.mw-parser-output .hlist dt li:first-child::before,.mw-parser-output .hlist li dd:first-child::before,.mw-parser-output .hlist li dt:first-child::before,.mw-parser-output .hlist li li:first-child::before{content:" (";font-weight:normal}.mw-parser-output .hlist dd dd:last-child::after,.mw-parser-output .hlist dd dt:last-child::after,.mw-parser-output .hlist dd li:last-child::after,.mw-parser-output .hlist dt dd:last-child::after,.mw-parser-output .hlist dt dt:last-child::after,.mw-parser-output .hlist dt li:last-child::after,.mw-parser-output .hlist li dd:last-child::after,.mw-parser-output .hlist li dt:last-child::after,.mw-parser-output .hlist li li:last-child::after{content:")";font-weight:normal}.mw-parser-output .hlist ol{counter-reset:listitem}.mw-parser-output .hlist ol>li{counter-increment:listitem}.mw-parser-output .hlist ol>li::before{content:" "counter(listitem)"\a0 "}.mw-parser-output .hlist dd ol>li:first-child::before,.mw-parser-output .hlist dt ol>li:first-child::before,.mw-parser-output .hlist li ol>li:first-child::before{content:" ("counter(listitem)"\a0 "}

/* end https://en.wikipedia.org/ */

</style><style data-mw-deduplicate="TemplateStyles:r1246091330">

/* start https://en.wikipedia.org/ */

.mw-parser-output .sidebar{width:22em;float:right;clear:right;margin:0.5em 0 1em 1em;background:var(--background-color-neutral-subtle,#f8f9fa);border:1px solid var(--border-color-base,#a2a9b1);padding:0.2em;text-align:center;line-height:1.4em;font-size:88%;border-collapse:collapse;display:table}body.skin-minerva .mw-parser-output .sidebar{display:table!important;float:right!important;margin:0.5em 0 1em 1em!important}.mw-parser-output .sidebar-subgroup{width:100%;margin:0;border-spacing:0}.mw-parser-output .sidebar-left{float:left;clear:left;margin:0.5em 1em 1em 0}.mw-parser-output .sidebar-none{float:none;clear:both;margin:0.5em 1em 1em 0}.mw-parser-output .sidebar-outer-title{padding:0 0.4em 0.2em;font-size:125%;line-height:1.2em;font-weight:bold}.mw-parser-output .sidebar-top-image{padding:0.4em}.mw-parser-output .sidebar-top-caption,.mw-parser-output .sidebar-pretitle-with-top-image,.mw-parser-output .sidebar-caption{padding:0.2em 0.4em 0;line-height:1.2em}.mw-parser-output .sidebar-pretitle{padding:0.4em 0.4em 0;line-height:1.2em}.mw-parser-output .sidebar-title,.mw-parser-output .sidebar-title-with-pretitle{padding:0.2em 0.8em;font-size:145%;line-height:1.2em}.mw-parser-output .sidebar-title-with-pretitle{padding:0.1em 0.4em}.mw-parser-output .sidebar-image{padding:0.2em 0.4em 0.4em}.mw-parser-output .sidebar-heading{padding:0.1em 0.4em}.mw-parser-output .sidebar-content{padding:0 0.5em 0.4em}.mw-parser-output .sidebar-content-with-subgroup{padding:0.1em 0.4em 0.2em}.mw-parser-output .sidebar-above,.mw-parser-output .sidebar-below{padding:0.3em 0.8em;font-weight:bold}.mw-parser-output .sidebar-collapse .sidebar-above,.mw-parser-output .sidebar-collapse .sidebar-below{border-top:1px solid #aaa;border-bottom:1px solid #aaa}.mw-parser-output .sidebar-navbar{text-align:right;font-size:115%;padding:0 0.4em 0.4em}.mw-parser-output .sidebar-list-title{padding:0 0.4em;text-align:left;font-weight:bold;line-height:1.6em;font-size:105%}.mw-parser-output .sidebar-list-title-c{padding:0 0.4em;text-align:center;margin:0 3.3em}@media(max-width:640px){body.mediawiki .mw-parser-output .sidebar{width:100%!important;clear:both;float:none!important;margin-left:0!important;margin-right:0!important}}body.skin--responsive .mw-parser-output .sidebar a>img{max-width:none!important}@media screen{html.skin-theme-clientpref-night .mw-parser-output .sidebar:not(.notheme) .sidebar-list-title,html.skin-theme-clientpref-night .mw-parser-output .sidebar:not(.notheme) .sidebar-title-with-pretitle{background:transparent!important}html.skin-theme-clientpref-night .mw-parser-output .sidebar:not(.notheme) .sidebar-title-with-pretitle a{color:var(--color-progressive)!important}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .sidebar:not(.notheme) .sidebar-list-title,html.skin-theme-clientpref-os .mw-parser-output .sidebar:not(.notheme) .sidebar-title-with-pretitle{background:transparent!important}html.skin-theme-clientpref-os .mw-parser-output .sidebar:not(.notheme) .sidebar-title-with-pretitle a{color:var(--color-progressive)!important}}@media print{body.ns-0 .mw-parser-output .sidebar{display:none!important}}

/* end https://en.wikipedia.org/ */

</style><table class="sidebar nomobile nowraplinks"><tbody><tr><th class="sidebar-title"><a class="mw-selflink-fragment" href="#Loops">Loop constructs</a></th></tr><tr><td class="sidebar-content">

<ul><li><a href="Do_while_loop" title="Do while loop">Do while loop</a></li>

<li><a href="While_loop" title="While loop">While loop</a></li>

<li><a href="Foreach_loop" title="Foreach loop">Foreach loop</a></li>

<li><a href="Infinite_loop" title="Infinite loop">Infinite loop</a></li>

</ul>

</div></td>

</tr><tr><td class="sidebar-navbar"><style data-mw-deduplicate="TemplateStyles:r1239400231">

/* start https://en.wikipedia.org/ */

.mw-parser-output .navbar{display:inline;font-size:88%;font-weight:normal}.mw-parser-output .navbar-collapse{float:left;text-align:left}.mw-parser-output .navbar-boxtext{word-spacing:0}.mw-parser-output .navbar ul{display:inline-block;white-space:nowrap;line-height:inherit}.mw-parser-output .navbar-brackets::before{margin-right:-0.125em;content:"[ "}.mw-parser-output .navbar-brackets::after{margin-left:-0.125em;content:" ]"}.mw-parser-output .navbar li{word-spacing:-0.125em}.mw-parser-output .navbar a>span,.mw-parser-output .navbar a>abbr{text-decoration:inherit}.mw-parser-output .navbar-mini abbr{font-variant:small-caps;border-bottom:none;text-decoration:none;cursor:inherit}.mw-parser-output .navbar-ct-full{font-size:114%;margin:0 7em}.mw-parser-output .navbar-ct-mini{font-size:114%;margin:0 4em}html.skin-theme-clientpref-night .mw-parser-output .navbar li a abbr{color:var(--color-base)!important}@media(prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .navbar li a abbr{color:var(--color-base)!important}}@media print{.mw-parser-output .navbar{display:none!important}}

/* end https://en.wikipedia.org/ */

</style></td></tr></tbody></table>

In <a href="Computer_science" title="Computer science">computer science</a>, control flow (or flow of control) is the order in which individual <a href="Statement_(computer_science)" title="Statement (computer science)">statements</a>, <a href="Instruction_(computer_science)" class="mw-redirect" title="Instruction (computer science)">instructions</a> or <a href="Function_call" class="mw-redirect" title="Function call">function calls</a> of an <a href="Imperative_programming" title="Imperative programming">imperative</a> <a href="Computer_program" title="Computer program">program</a> are <a href="Execution_(computing)" title="Execution (computing)">executed</a> or evaluated. The emphasis on explicit control flow distinguishes an <a href="Imperative_programming" title="Imperative programming">imperative programming</a> language from a <a href="Declarative_programming" title="Declarative programming">declarative programming</a> language.

Within an imperative <a href="Programming_language" title="Programming language">programming language</a>, a control flow statement is a statement that results in a choice being made as to which of two or more paths to follow. For <a href="Strict_programming_language" title="Strict programming language">non-strict</a> functional languages, functions and <a href="Language_construct" title="Language construct">language constructs</a> exist to achieve the same result, but they are usually not termed control flow statements.

A set of statements is in turn generally structured as a <a href="Block_(programming)" title="Block (programming)">block</a>, which in addition to grouping, also defines a <a href="Lexical_scope" class="mw-redirect" title="Lexical scope">lexical scope</a>.

<a href="Interrupt" title="Interrupt">Interrupts</a> and <a href="Signal_(computing)" class="mw-redirect" title="Signal (computing)">signals</a> are low-level mechanisms that can alter the flow of control in a way similar to a <a href="Subroutine" class="mw-redirect" title="Subroutine">subroutine</a>, but usually occur as a response to some external stimulus or event (that can occur <a href="Asynchronous_systems" class="mw-redirect" title="Asynchronous systems">asynchronously</a>), rather than execution of an in-line control flow statement.

At the level of <a href="Machine_language" class="mw-redirect" title="Machine language">machine language</a> or <a href="Assembly_language" title="Assembly language">assembly language</a>, control flow instructions usually work by altering the <a href="Program_counter" title="Program counter">program counter</a>. For some <a href="Central_processing_unit" title="Central processing unit">central processing units</a> (CPUs), the only control flow instructions available are conditional or unconditional <a href="Branch_(computer_science)" title="Branch (computer science)">branch</a> instructions, also termed jumps. However there is also <a href="Predication_(computer_architecture)" title="Predication (computer architecture)">predication</a> which conditionally enables or disables instructions without branching: as an alternative technique it can have both <a href="Predication_(computer_architecture)#Advantages" title="Predication (computer architecture)">advantages</a> and disadvantages over branching.

<div class="mw-heading mw-heading2"><h2 id="Categories">Categories</h2></div>

The kinds of control flow statements supported by different languages vary, but can be categorized by their effect:

<ul><li>Continuation at a different statement (unconditional <a href="Branch_(computer_science)" title="Branch (computer science)">branch</a> or jump)</li>

<li>Executing a set of statements only if some condition is met (choice - i.e., <a href="Conditional_branch" class="mw-redirect" title="Conditional branch">conditional branch</a>)</li>

<li>Executing a set of statements zero or more times, until some condition is met (i.e., loop - the same as <a href="Conditional_branch" class="mw-redirect" title="Conditional branch">conditional branch</a>)</li>

<li>Executing a set of distant statements, after which the flow of control usually returns (<a href="Subroutine" class="mw-redirect" title="Subroutine">subroutines</a>, <a href="Coroutine" title="Coroutine">coroutines</a>, and <a href="Continuation" title="Continuation">continuations</a>)</li>

<li>Stopping the program, preventing any further execution (unconditional halt)</li></ul>

<div class="mw-heading mw-heading2"><h2 id="Primitives">Primitives</h2></div>

<div class="mw-heading mw-heading3"><h3 id="Labels">Labels</h3></div>

<div role="note" class="hatnote navigation-not-searchable">Main article: <a href="Label_(computer_science)" title="Label (computer science)">Label (computer science)</a></div>

A <a href="Label_(programming_language)" class="mw-redirect" title="Label (programming language)">label</a> is an explicit name or number assigned to a fixed position within the <a href="Source_code" title="Source code">source code</a>, and which may be referenced by control flow statements appearing elsewhere in the source code. A label marks a position within source code and has no other effect.

<a href="Line_number" title="Line number">Line numbers</a> are an alternative to a named label used in some languages (such as <a href="BASIC" title="BASIC">BASIC</a>). They are <a href="Natural_number" title="Natural number">whole numbers</a> placed at the start of each line of text in the source code. Languages which use these often impose the constraint that the line numbers must increase in value in each following line, but may not require that they be consecutive. For example, in BASIC:

<div class="mw-highlight mw-highlight-lang-qbasic mw-content-ltr" dir="ltr"><pre>10 LET X = 3

20 PRINT X

</pre></div>

In other languages such as <a href="C_(programming_language)" title="C (programming language)">C</a> and <a href="Ada_(programming_language)" title="Ada (programming language)">Ada</a>, a label is an <a href="Identifier" title="Identifier">identifier</a>, usually appearing at the start of a line and immediately followed by a colon. For example, in C:

<div class="mw-highlight mw-highlight-lang-c mw-content-ltr" dir="ltr"><pre>Success: printf("The operation was successful.\n");

</pre></div>

The language <a href="ALGOL_60" title="ALGOL 60">ALGOL 60</a> allowed both whole numbers and identifiers as labels (both linked by colons to the following statement), but few if any other <a href="ALGOL" title="ALGOL">ALGOL</a> variants allowed whole numbers. Early <a href="Fortran" title="Fortran">Fortran</a> compilers only allowed whole numbers as labels. Beginning with Fortran-90, alphanumeric labels have also been allowed.

<div role="note" class="hatnote navigation-not-searchable">Main article: <a href="GOTO" class="mw-redirect" title="GOTO">GOTO</a></div>

The goto statement (a combination of the English words <a href="https://en.wiktionary.org/wiki/go" class="extiw external" title="wiktionary:go">go</a> and <a href="https://en.wiktionary.org/wiki/to" class="extiw external" title="wiktionary:to">to</a>, and pronounced accordingly) is the most basic form of unconditional transfer of control.

Although the <a href="Keyword_(computing)" class="mw-redirect" title="Keyword (computing)">keyword</a> may either be in upper or lower case depending on the language, it is usually written as:

<pre> goto label

</pre>

The effect of a goto statement is to cause the next statement to be executed to be the statement appearing at (or immediately after) the indicated label.

Goto statements have been <a href="Considered_harmful" title="Considered harmful">considered harmful</a> by many computer scientists, notably <a href="Edsger_W._Dijkstra" title="Edsger W. Dijkstra">Dijkstra</a>.

<div class="mw-heading mw-heading3"><h3 id="Subroutines">Subroutines</h3></div>

<div role="note" class="hatnote navigation-not-searchable">Main article: <a href="Subroutine" class="mw-redirect" title="Subroutine">Subroutine</a></div>

The terminology for <a href="Subroutine" class="mw-redirect" title="Subroutine">subroutines</a> varies; they may alternatively be known as routines, procedures, functions (especially if they return results) or methods (especially if they belong to <a href="Class_(programming)" class="mw-redirect" title="Class (programming)">classes</a> or <a href="Type_class" title="Type class">type classes</a>).

In the 1950s, computer memories were very small by current standards so subroutines were used mainly to reduce program size. A piece of code was written once and then used many times from various other places in a program.

Today, subroutines are more often used to help make a program more structured, e.g., by isolating some algorithm or hiding some data access method. If many programmers are working on one program, subroutines are one kind of <a href="Modularity_(programming)" class="mw-redirect" title="Modularity (programming)">modularity</a> that can help divide the work.

<div class="mw-heading mw-heading3"><h3 id="Sequence">Sequence</h3></div>

<div role="note" class="hatnote navigation-not-searchable">Main article: <a href="Structured_programming" title="Structured programming">Structured programming</a></div>

In structured programming, the ordered sequencing of successive commands is considered one of the basic control structures, which is used as a building block for programs alongside iteration, recursion and choice.

<div class="mw-heading mw-heading2"><h2 id="Minimal_structured_control_flow">Minimal structured control flow</h2></div>

<div role="note" class="hatnote navigation-not-searchable">See also: <a href="Structured_program_theorem" title="Structured program theorem">Structured program theorem</a></div>

In May 1966, Böhm and Jacopini published an article<a href="#cite_note-1">[1]</a> in Communications of the ACM which showed that any program with gotos could be transformed into a goto-free form involving only choice (IF THEN ELSE) and loops (WHILE condition DO xxx), possibly with duplicated code and/or the addition of Boolean variables (true/false flags). Later authors showed that choice can be replaced by loops (and yet more Boolean variables).

That such minimalism is possible does not mean that it is necessarily desirable; computers theoretically need only <a href="One_instruction_set_computer" class="mw-redirect" title="One instruction set computer">one machine instruction</a> (subtract one number from another and branch if the result is negative), but practical computers have dozens or even hundreds of machine instructions.

Other research showed that control structures with one entry and one exit were much easier to understand than any other form, mainly because they could be used anywhere as a statement without disrupting the control flow. In other words, they were composable. (Later developments, such as <a href="Non-strict_programming_language" class="mw-redirect" title="Non-strict programming language">non-strict programming languages</a> – and more recently, composable <a href="Software_transactional_memory" title="Software transactional memory">software transactions</a> – have continued this strategy, making components of programs even more freely composable.)

Some academics took a purist approach to the Böhm–Jacopini result and argued that even instructions like <code>break</code> and <code>return</code> from the middle of loops are bad practice as they are not needed in the Böhm–Jacopini proof, and thus they advocated that all loops should have a single exit point. This purist approach is embodied in the language <a href="Pascal_(programming_language)" title="Pascal (programming language)">Pascal</a> (designed in 1968–1969), which up to the mid-1990s was the preferred tool for teaching introductory programming in academia.<a href="#cite_note-roberts-2">[2]</a> The direct application of the Böhm–Jacopini theorem may result in additional local variables being introduced in the structured chart, and may also result in some <a href="Code_duplication" class="mw-redirect" title="Code duplication">code duplication</a>.<a href="#cite_note-WattFindlay2004-3">[3]</a> Pascal is affected by both of these problems and according to empirical studies cited by <a href="Eric_S._Roberts" title="Eric S. Roberts">Eric S. Roberts</a>, student programmers had difficulty formulating correct solutions in Pascal for several simple problems, including writing a function for searching an element in an array. A 1980 study by Henry Shapiro cited by Roberts found that using only the Pascal-provided control structures, the correct solution was given by only 20% of the subjects, while no subject wrote incorrect code for this problem if allowed to write a return from the middle of a loop.<a href="#cite_note-roberts-2">[2]</a>

<div class="mw-heading mw-heading2"><h2 id="Control_structures_in_practice">Control structures in practice</h2></div>

Most programming languages with control structures have an initial keyword which indicates the type of control structure involved. Languages then divide as to whether or not control structures have a final keyword.

<ul><li>No final keyword: <a href="ALGOL_60" title="ALGOL 60">ALGOL 60</a>, <a href="C_(programming_language)" title="C (programming language)">C</a>, <a href="C%2B%2B" title="C++">C++</a>, <a href="Go_(programming_language)" title="Go (programming language)">Go</a>, <a href="Haskell" title="Haskell">Haskell</a>, <a href="Java_(programming_language)" title="Java (programming language)">Java</a>, <a href="Pascal_(programming_language)" title="Pascal (programming language)">Pascal</a>, <a href="Perl" title="Perl">Perl</a>, <a href="PHP" title="PHP">PHP</a>, <a href="PL/I" title="PL/I">PL/I</a>, <a href="Python_(programming_language)" title="Python (programming language)">Python</a>, <a href="PowerShell" title="PowerShell">PowerShell</a>. Such languages need some way of grouping statements together:

<ul><li>ALGOL 60 and Pascal: <code>begin</code> ... <code>end</code></li>

<li>C, C++, Go, Java, Perl, PHP, and PowerShell: <a href="Curly_bracket_programming_language" class="mw-redirect" title="Curly bracket programming language">curly brackets</a> <code>{</code> ... <code>}</code></li>

<li>Python: uses <a href="Indent_style" class="mw-redirect" title="Indent style">indent</a> level (see <a href="Off-side_rule" title="Off-side rule">Off-side rule</a>)</li>

<li>Haskell: either <a href="Indent_style" class="mw-redirect" title="Indent style">indent</a> level or curly brackets can be used, and they can be freely mixed</li>

<li>Final keyword: <a href="Ada_(programming_language)" title="Ada (programming language)">Ada</a>, <a href="APL_(programming_language)" title="APL (programming language)">APL</a>, <a href="ALGOL_68" title="ALGOL 68">ALGOL 68</a>, <a href="Modula-2" title="Modula-2">Modula-2</a>, <a href="Fortran_77" class="mw-redirect" title="Fortran 77">Fortran 77</a>, Mythryl, <a href="Visual_Basic" title="Visual Basic">Visual Basic</a>. The forms of the final keyword vary:

<ul><li>Ada: final keyword is <code>end</code> + space + initial keyword e.g., <code>if</code> ... <code>end if</code>, <code>loop</code> ... <code>end loop</code></li>

<li>APL: final keyword is <code>:End</code> optionally + initial keyword, e.g., <code>:If</code> ... <code>:End</code> or <code>:If</code> ... <code>:EndIf</code>, <code>Select</code> ... <code>:End</code> or <code>:Select</code> ... <code>:EndSelect</code>, however, if adding an end condition, the end keyword becomes <code>:Until</code></li>

<li>ALGOL 68, Mythryl: initial keyword spelled backwards e.g., <code>if</code> ... <code>fi</code>, <code>case</code> ... <code>esac</code></li>

<li>Fortran 77: final keyword is <code>END</code> + initial keyword e.g., <code>IF</code> ... <code>ENDIF</code>, <code>DO</code> ... <code>ENDDO</code></li>

<li>Modula-2: same final keyword <code>END</code> for everything</li>

<li>Visual Basic: every control structure has its own keyword. <code>If</code> ... <code>End If</code>; <code>For</code> ... <code>Next</code>; <code>Do</code> ... <code>Loop</code>; <code>While</code> ... <code>Wend</code></li></ul></li></ul>

<div class="mw-heading mw-heading2"><h2 id="Choice">Choice</h2></div>

<div class="mw-heading mw-heading3"><h3 id="If-then-(else)_statements">If-then-(else) statements</h3></div>

<div role="note" class="hatnote navigation-not-searchable">Main article: <a href="Conditional_(computer_programming)" title="Conditional (computer programming)">Conditional (computer programming)</a></div>

Conditional expressions and conditional constructs are features of a <a href="Programming_language" title="Programming language">programming language</a> that perform different computations or actions depending on whether a programmer-specified <a href="Boolean_data_type" title="Boolean data type">Boolean</a> condition evaluates to true or false.

<ul><li><code>IF..GOTO</code>. A form found in unstructured languages, mimicking a typical machine code instruction, would jump to (GOTO) a label or line number when the condition was met.</li>

<li><code>IF..THEN..(ENDIF)</code>. Rather than being restricted to a jump, any simple statement, or nested block, could follow the THEN key keyword. This a structured form.</li>

<li><code>IF..THEN..ELSE..(ENDIF)</code>. As above, but with a second action to be performed if the condition is false. This is one of the most common forms, with many variations. Some require a terminal <code>ENDIF</code>, others do not. <a href="C_(programming_language)" title="C (programming language)">C</a> and related languages do not require a terminal keyword, or a 'then', but do require parentheses around the condition.</li>

<li>Conditional statements can be and often are nested inside other conditional statements. Some languages allow <code>ELSE</code> and <code>IF</code> to be combined into <code>ELSEIF</code>, avoiding the need to have a series of <code>ENDIF</code> or other final statements at the end of a compound statement.</li></ul>

<th><a href="Pascal_(programming_language)" title="Pascal (programming language)">Pascal</a>:

</th>

<th><a href="Ada_(programming_language)" title="Ada (programming language)">Ada</a>:

</th></tr>

<tr>

<td><div class="mw-highlight mw-highlight-lang-pascal mw-content-ltr" dir="ltr"><pre>if a > 0 then

writeln("yes")

else

writeln("no");

</pre></div>

</td>

<td><div class="mw-highlight mw-highlight-lang-ada mw-content-ltr" dir="ltr"><pre>if a > 0 then

Put_Line("yes");

else

Put_Line("no");

end if;

</pre></div>

</td></tr>

<tr>

<th><a href="C_(programming_language)" title="C (programming language)">C</a>:

</th>

<th><a href="Shell_script" title="Shell script">Shell script</a>:

</th></tr>

<tr>

<td><div class="mw-highlight mw-highlight-lang-c mw-content-ltr" dir="ltr"><pre>if (a > 0) {

puts("yes");

}

else {

puts("no");

}

</pre></div>

</td>

<td><div class="mw-highlight mw-highlight-lang-bash mw-content-ltr" dir="ltr"><pre>if [ $a -gt 0 ]; then

echo "yes"

else

echo "no"

fi

</pre></div>

</td></tr>

<tr>

<th><a href="Python_(programming_language)" title="Python (programming language)">Python</a>:

</th>

<th><a href="Lisp_(programming_language)" title="Lisp (programming language)">Lisp</a>:

</th></tr>

<tr>

<td><div class="mw-highlight mw-highlight-lang-python mw-content-ltr" dir="ltr"><pre>if a > 0:

print("yes")

else:

print("no")

</pre></div>

</td>

<td><div class="mw-highlight mw-highlight-lang-lisp mw-content-ltr" dir="ltr"><pre>(princ

(if (plusp a)

"yes"

"no"))

</pre></div>

</td></tr></tbody></table>

Less common variations include:

<ul><li>Some languages, such as early <a href="Fortran" title="Fortran">Fortran</a>,<a href="#cite_note-4">[a]</a> have a three-way or <a href="Arithmetic_if" class="mw-redirect" title="Arithmetic if">arithmetic if</a>, testing whether a numeric value is negative, zero, or positive.</li>

<li>Some languages have a <a href="Functional_programming" title="Functional programming">functional</a> form of an <code>if</code> statement, for instance <a href="Lisp_(programming_language)" title="Lisp (programming language)">Lisp's</a> <code>cond</code>.</li>

<li>Some languages have an <a href="Operator_(programming)" class="mw-redirect" title="Operator (programming)">operator</a> form of an <code>if</code> statement, such as C's <a href="Ternary_operator" class="mw-redirect" title="Ternary operator">ternary operator</a>.</li>

<li><a href="Perl" title="Perl">Perl</a> supplements a C-style <code>if</code> with <code>when</code> and <code>unless</code>.</li>

<li><a href="Smalltalk" title="Smalltalk">Smalltalk</a> uses <code>ifTrue</code> and <code>ifFalse</code> messages to implement conditionals, rather than any fundamental language construct.</li></ul>

<div class="mw-heading mw-heading3"><h3 id="Case_and_switch_statements">Case and switch statements</h3></div>

<div role="note" class="hatnote navigation-not-searchable">Main article: <a href="Switch_statement" title="Switch statement">Switch statement</a></div>

<a href="Switch_statement" title="Switch statement">Switch statements</a> (or case statements, or multiway branches) compare a given value with specified constants and take action according to the first constant to match. There is usually a provision for a default action ("else", "otherwise") to be taken if no match succeeds. Switch statements can allow compiler optimizations, such as <a href="Lookup_table" title="Lookup table">lookup tables</a>. In <a href="Dynamic_language" class="mw-redirect" title="Dynamic language">dynamic languages</a>, the cases may not be limited to constant expressions, and might extend to <a href="Pattern_matching" title="Pattern matching">pattern matching</a>, as in the <a href="Shell_script" title="Shell script">shell script</a> example on the right, where the <code>*)</code> implements the default case as a <a href="Glob_(programming)" title="Glob (programming)">glob</a> matching any string. Case logic can also be implemented in functional form, as in <a href="SQL" title="SQL">SQL</a>'s <code>decode</code> statement.

<th><a href="Pascal_(programming_language)" title="Pascal (programming language)">Pascal</a>:

</th>

<th><a href="Ada_(programming_language)" title="Ada (programming language)">Ada</a>:

</th></tr>

<tr>

<td><div class="mw-highlight mw-highlight-lang-pascal mw-content-ltr" dir="ltr"><pre>case someChar of

'a': actionOnA;

'x': actionOnX;

'y','z':actionOnYandZ;

else actionOnNoMatch;

end;

</pre></div>

</td>

<td><div class="mw-highlight mw-highlight-lang-ada mw-content-ltr" dir="ltr"><pre>case someChar is

when 'a' => actionOnA;

when 'x' => actionOnX;

when 'y' | 'z' => actionOnYandZ;

when others => actionOnNoMatch;

end;

</pre></div>

</td></tr>

<tr>

<th><a href="C_(programming_language)" title="C (programming language)">C</a>:

</th>

<th><a href="Shell_script" title="Shell script">Shell script</a>:

</th></tr>

<tr>

<td><div class="mw-highlight mw-highlight-lang-c mw-content-ltr" dir="ltr"><pre>switch (someChar) {

case 'a': actionOnA; break;

case 'x': actionOnX; break;

case 'y':

case 'z': actionOnYandZ; break;

default: actionOnNoMatch;

}

</pre></div>

</td>

<td><div class="mw-highlight mw-highlight-lang-bash mw-content-ltr" dir="ltr"><pre>case $someChar in

a) actionOnA ;;

x) actionOnX ;;

[yz]) actionOnYandZ ;;

*) actionOnNoMatch ;;

esac

</pre></div>

</td></tr>

<tr>

<th><a href="Lisp_(programming_language)" title="Lisp (programming language)">Lisp</a>:

</th>

<th><a href="Fortran" title="Fortran">Fortran</a>:

</th></tr>

<tr>

<td><div class="mw-highlight mw-highlight-lang-lisp mw-content-ltr" dir="ltr"><pre>(case some-char

((#\a) action-on-a)

((#\x) action-on-x)

((#\y #\z) action-on-y-and-z)

(else action-on-no-match))

</pre></div>

</td>

<td><div class="mw-highlight mw-highlight-lang-fortran mw-content-ltr" dir="ltr"><pre>select case (someChar)

case ('a')

actionOnA

case ('x')

actionOnX

case ('y','z')

actionOnYandZ

case default

actionOnNoMatch

end select

</pre></div>

</td></tr></tbody></table>

<div class="mw-heading mw-heading2"><h2 id="Loops">Loops</h2></div>

A loop is a sequence of statements which is specified once but which may be carried out several times in succession. The code "inside" the loop (the body of the loop, shown below as xxx) is obeyed a specified number of times, or once for each of a collection of items (both cases of definite iteration), or until some condition is met (indefinite iteration), or <a href="Infinite_loop" title="Infinite loop">infinitely</a>. When one of those items is itself also a loop, it is called a "nested loop".<a href="#cite_note-5">[4]</a><a href="#cite_note-6">[5]</a><a href="#cite_note-7">[6]</a>

Some common situations are not well-handled by these basic control structures, and are generally addressed by early exit from the loop, in the form of a break from the loop, a return from the function, or an exception being raised.<a href="#cite_note-8">[7]</a><a href="#cite_note-roberts-2">[2]</a>

In <a href="Functional_programming" title="Functional programming">functional programming</a> languages, such as <a href="Haskell" title="Haskell">Haskell</a> and <a href="Scheme_(programming_language)" title="Scheme (programming language)">Scheme</a>, both <a href="Recursion_(computer_science)" title="Recursion (computer science)">recursive</a> and <a href="Fixed_point_combinator" class="mw-redirect" title="Fixed point combinator">iterative</a> processes are expressed with <a href="Tail_recursion" class="mw-redirect" title="Tail recursion">tail recursive</a> procedures instead of looping constructs that are syntactic.

<div class="mw-heading mw-heading3"><h3 id="Count-controlled_loops">Count-controlled loops</h3></div>

<div role="note" class="hatnote navigation-not-searchable">Main article: <a href="For_loop" title="For loop">For loop</a></div>

Most programming languages have constructions for repeating a loop a certain number of times.

In most cases counting can go downwards instead of upwards and step sizes other than 1 can be used.

<td>

<pre>FOR I = 1 TO N

xxx

NEXT I

</pre>

</td>

<td>

<pre>for I := 1 to N do begin

xxx

end;

</pre>

</td></tr>

<tr>

<td>

<pre>DO I = 1,N

xxx

END DO

</pre>

</td>

<td>

<pre>for ( I=1; I<=N; ++I ) {

xxx

}

</pre>

</td></tr></tbody></table>

In these examples, if N < 1 then the body of loop may execute once (with I having value 1) or not at all, depending on the programming language.

In many programming languages, only integers can be reliably used in a count-controlled loop. Floating-point numbers are represented imprecisely due to hardware constraints, so a loop such as

<pre> for X := 0.1 step 0.1 to 1.0 do

</pre>

might be repeated 9 or 10 times, depending on rounding errors and/or the hardware and/or the compiler version. Furthermore, if the increment of X occurs by repeated addition, accumulated rounding errors may mean that the value of X in each iteration can differ quite significantly from the expected sequence 0.1, 0.2, 0.3, ..., 1.0.

<div class="mw-heading mw-heading3"><h3 id="Condition-controlled_loops">Condition-controlled loops</h3></div>

<div role="note" class="hatnote navigation-not-searchable">Main articles: <a href="While_loop" title="While loop">While loop</a> and <a href="Do_while_loop" title="Do while loop">Do while loop</a></div>

Most programming languages have constructions for repeating a loop until some condition changes. Some variations test the condition at the start of the loop; others test it at the end. If the test is at the start, the body may be skipped completely; if it is at the end, the body is always executed at least once.

<td>

<pre>DO WHILE (test)

xxx

LOOP

</pre>

</td>

<td>

<pre>repeat

xxx

until test;

</pre>

</td></tr>

<tr>

<td>

<pre>while (test) {

xxx

}

</pre>

</td>

<td>

<pre>do

xxx

while (test);

</pre>

</td></tr></tbody></table>

A <a href="Control_break" title="Control break">control break</a> is a value change detection method used within ordinary loops to trigger processing for groups of values. Values are monitored within the loop and a change diverts program flow to the handling of the group event associated with them.

<pre> DO UNTIL (End-of-File)

IF new-zipcode <> current-zipcode

display_tally(current-zipcode, zipcount)

current-zipcode = new-zipcode

zipcount = 0

ENDIF

zipcount++

LOOP

</pre>

<div class="mw-heading mw-heading3"><h3 id="Collection-controlled_loops">Collection-controlled loops</h3></div>

<div role="note" class="hatnote navigation-not-searchable">Main article: <a href="Foreach_loop" title="Foreach loop">Foreach</a></div>

Several programming languages (e.g., <a href="Ada_(programming_language)" title="Ada (programming language)">Ada</a>, <a href="APL_(programming_language)" title="APL (programming language)">APL</a>, <a href="D_(programming_language)" title="D (programming language)">D</a>, <a href="C%2B%2B11" title="C++11">C++11</a>, <a href="Smalltalk" title="Smalltalk">Smalltalk</a>, <a href="PHP" title="PHP">PHP</a>, <a href="Perl" title="Perl">Perl</a>, <a href="Object_Pascal" title="Object Pascal">Object Pascal</a>, <a href="Java_(programming_language)" title="Java (programming language)">Java</a>, <a href="C_Sharp_(programming_language)" title="C Sharp (programming language)">C#</a>, <a href="MATLAB" title="MATLAB">MATLAB</a>, <a href="Visual_Basic" title="Visual Basic">Visual Basic</a>, <a href="Ruby_(programming_language)" title="Ruby (programming language)">Ruby</a>, <a href="Python_(programming_language)" title="Python (programming language)">Python</a>, <a href="JavaScript" title="JavaScript">JavaScript</a>, <a href="Fortran_95" class="mw-redirect" title="Fortran 95">Fortran 95</a> and later) have special constructs which allow implicit looping through all elements of an array, or all members of a set or collection.

<pre> someCollection do: [:eachElement |xxx].

for Item in Collection do begin xxx end;

foreach (item; myCollection) { xxx }

foreach someArray { xxx }

foreach ($someArray as $k => $v) { xxx }

Collection<String> coll; for (String s : coll) {}

foreach (string s in myStringCollection) { xxx }

someCollection | ForEach-Object { $_ }

forall ( index = first:last:step... )

</pre>

<a href="Scala_(programming_language)" title="Scala (programming language)">Scala</a> has <a href="Scala_(programming_language)#For-expressions" title="Scala (programming language)">for-expressions</a>, which generalise collection-controlled loops, and also support other uses, such as <a href="Asynchronous_programming" class="mw-redirect" title="Asynchronous programming">asynchronous programming</a>. <a href="Haskell" title="Haskell">Haskell</a> has do-expressions and comprehensions, which together provide similar function to for-expressions in Scala.

<div class="mw-heading mw-heading3"><h3 id="General_iteration">General iteration</h3></div>

General iteration constructs such as C's <code>for</code> statement and <a href="Common_Lisp" title="Common Lisp">Common Lisp</a>'s <code>do</code> form can be used to express any of the above sorts of loops, and others, such as looping over some number of collections in parallel. Where a more specific looping construct can be used, it is usually preferred over the general iteration construct, since it often makes the purpose of the expression clearer.

<div class="mw-heading mw-heading3"><h3 id="Infinite_loops">Infinite loops</h3></div>

<div role="note" class="hatnote navigation-not-searchable">Main article: <a href="Infinite_loop" title="Infinite loop">Infinite loop</a></div>

<a href="Infinite_loop" title="Infinite loop">Infinite loops</a> are used to assure a program segment loops forever or until an exceptional condition arises, such as an error. For instance, an event-driven program (such as a <a href="Server_(computing)" title="Server (computing)">server</a>) should loop forever, handling events as they occur, only stopping when the process is terminated by an operator.

Infinite loops can be implemented using other control flow constructs. Most commonly, in unstructured programming this is jump back up (goto), while in structured programming this is an indefinite loop (while loop) set to never end, either by omitting the condition or explicitly setting it to true, as <code>while (true) ...</code>. Some languages have special constructs for infinite loops, typically by omitting the condition from an indefinite loop. Examples include Ada (<code>loop ... end loop</code>),<a href="#cite_note-9">[8]</a> Fortran (<code>DO ... END DO</code>), Go (<code>for { ... }</code>), and Ruby (<code>loop do ... end</code>).

Often, an infinite loop is unintentionally created by a programming error in a condition-controlled loop, wherein the loop condition uses variables that never change within the loop.

<div class="mw-heading mw-heading3"><h3 id="Continuation_with_next_iteration">Continuation with next iteration</h3></div>

Sometimes within the body of a loop there is a desire to skip the remainder of the loop body and continue with the next iteration of the loop. Some languages provide a statement such as <code>continue</code> (most languages), <code>skip</code>,<a href="#cite_note-10">[9]</a> <code>cycle</code> (Fortran), or <code>next</code> (Perl and Ruby), which will do this. The effect is to prematurely terminate the innermost loop body and then resume as normal with the next iteration. If the iteration is the last one in the loop, the effect is to terminate the entire loop early.

<div class="mw-heading mw-heading3"><h3 id="Redo_current_iteration">Redo current iteration</h3></div>

Some languages, like Perl<a href="#cite_note-11">[10]</a> and Ruby,<a href="#cite_note-12">[11]</a> have a <code>redo</code> statement that restarts the current iteration from the start.

<div class="mw-heading mw-heading3"><h3 id="Restart_loop">Restart loop</h3></div>

Ruby has a <code>retry</code> statement that restarts the entire loop from the initial iteration.<a href="#cite_note-13">[12]</a>

Common loop structures sometimes result in duplicated code, either repeated statements or repeated conditions. This arises for various reasons and has various proposed solutions to eliminate or minimize code duplication.<a href="#cite_note-c2messy-14">[13]</a> Other than the traditional unstructured solution of a goto statement,<a href="#cite_note-FOOTNOTEKnuth1974278Simple_Iterations-15">[14]</a> general structured solutions include having a conditional (if statement) inside the loop (possibly duplicating the condition but not the statements) or wrapping repeated logic in a function (so there is a duplicated function call, but the statements are not duplicated).<a href="#cite_note-c2messy-14">[13]</a>

A common case is where the start of the loop is always executed, but the end may be skipped on the last iteration.<a href="#cite_note-FOOTNOTEKnuth1974278Simple_Iterations-15">[14]</a> This was dubbed by Dijkstra a loop which is performed "n and a half times",<a href="#cite_note-16">[15]</a> and is now called the loop-and-a-half problem.<a href="#cite_note-roberts-2">[2]</a> Common cases include reading data in the first part, checking for end of data, and then processing the data in the second part; or processing, checking for end, and then preparing for the next iteration.<a href="#cite_note-FOOTNOTEKnuth1974278Simple_Iterations-15">[14]</a><a href="#cite_note-roberts-2">[2]</a> In these cases, the first part of the loop is executed ⁠<math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle n}">

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle n}</annotation>

</semantics>

</math><img src="./a601995d55609f2d9f5e233e36fbe9ea26011b3b.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.338ex; width:1.395ex; height:1.676ex;" alt="{\displaystyle n}" loading="lazy">⁠ times, but the second part is only executed ⁠<math xmlns="http://www.w3.org/1998/Math/MathML" alttext="{\displaystyle n-1}">

</mstyle>

</mrow>

<annotation encoding="application/x-tex">{\displaystyle n-1}</annotation>

</semantics>

</math><img src="./fbd0b0f32b28f51962943ee9ede4fb34198a2521.svg" class="mwe-math-fallback-image-inline mw-invert skin-invert" aria-hidden="true" style="vertical-align: -0.505ex; width:5.398ex; height:2.343ex;" alt="{\displaystyle n-1}" loading="lazy">⁠ times.

This problem has been recognized at least since 1967 by Knuth, with Wirth suggesting solving it via early loop exit.<a href="#cite_note-FOOTNOTEKnuth1974279-17">[16]</a> Since the 1990s this has been the most commonly taught solution, using a break statement, as in:<a href="#cite_note-roberts-2">[2]</a>

<pre>loop

statements

if condition break

statements

repeat

</pre>

A subtlety of this solution is that the condition is the opposite of a usual while condition: rewriting while condition ... repeat with an exit in the middle requires reversing the condition: loop ... if not condition exit ... repeat. The <a href="#Loop_with_test_in_the_middle">loop with test in the middle</a> control structure explicitly supports the loop-an-a-half use case, without reversing the condition.<a href="#cite_note-FOOTNOTEKnuth1974279-17">[16]</a>

<div class="mw-heading mw-heading3"><h3 id="Early_exit_from_loops">Early exit from loops</h3></div>

It is sometimes desirable to stop executing a loop before the end of the body; for example, when using a count-controlled loop to search through a table, one can stop as soon as the required item is found. Early exit is the most common way to solve the <a href="Loop-and-a-half" class="mw-redirect" title="Loop-and-a-half">loop-and-a-half</a> problem.<a href="#cite_note-roberts-2">[2]</a>

Some programming languages provide a statement such as <code>break</code> (most languages), <code>Exit</code> (Visual Basic), or <code>last</code> (Perl), which effect is to terminate the current loop immediately, and transfer control to the statement immediately after that loop.

Other mechanisms for early exit include a <code>return</code> out of a subroutine executing the looped statements, breaking out of both the loop and the subroutine; and raising an exception. There are other <a href="#Proposed_control_structures">proposed control structures</a>, but they are not commonly implemented. This section treats early exit from only the loop ("break").

Most commonly, this is used by combining a conditional (if statement) with an unconditional break, as in Ada:

<div class="mw-highlight mw-highlight-lang-ada mw-content-ltr" dir="ltr"><pre>loop

Get(X);

if X = 0 then

exit;

end if;

-- Do something with X.

end loop;

</pre></div>

In this form, the condition is interpreted as until. Some languages, such as Ada, have syntax for a conditional break, here an exit when clause (not to be confused with the exitwhen statement in <a href="#Proposed_control_structures">§ Proposed control structures</a>); if available, this is more idiomatic:

<div class="mw-highlight mw-highlight-lang-ada mw-content-ltr" dir="ltr"><pre>loop

Get(X);

exit when X = 0;

-- Do something with X.

end loop;

</pre></div>

This functions similarly to a <a href="#Loop_with_test_in_the_middle">loop with test in the middle</a>, but in that case the test is part of the structure of the loop, dividing the body of the loop in half (visually indented at the same level as the start/end of loop), while early exit is unstructured: simply a statement that can appear anywhere in the body of the loop, and in fact multiple break statements are possible.

<a href="Python_(programming_language)" title="Python (programming language)">Python</a> supports conditional execution of code depending on whether a loop was exited early (with a <code>break</code> statement) or not by using an else-clause with the loop. For example,

<div class="mw-highlight mw-highlight-lang-python mw-content-ltr" dir="ltr"><pre>for n in set_of_numbers:

if isprime(n):

print("Set contains a prime number")

break

else:

print("Set did not contain any prime numbers")

</pre></div>

The <code>else</code> clause in the above example is linked to the <code>for</code> statement, and not the inner <code>if</code> statement. Both Python's <code>for</code> and <code>while</code> loops support such an else clause, which is executed only if early exit of the loop has not occurred.

<div class="mw-heading mw-heading4"><h4 id="Multi-level_breaks">Multi-level breaks</h4></div>

Some languages support breaking out of nested loops; in theory circles, these are called multi-level breaks. One common use example is searching a multi-dimensional table. This can be done either via multilevel breaks (break out of N levels), as in bash<a href="#cite_note-18">[17]</a> and PHP,<a href="#cite_note-19">[18]</a> or via labeled breaks (break out and continue at given label), as in Ada. Go, Java and Perl.<a href="#cite_note-20">[19]</a> Alternatives to multilevel breaks include single breaks, together with a state variable which is tested to break out another level; exceptions, which are caught at the level being broken out to; placing the nested loops in a function and using return to effect termination of the entire nested loop; or using a label and a goto statement. C does not include a multilevel break, and the usual alternative is to use a goto to implement a labeled break.<a href="#cite_note-21">[20]</a> Python does not have a multilevel break or continue – this was proposed in <a rel="nofollow" class="external text" href="https://www.python.org/dev/peps/pep-3136/">PEP 3136</a>, and rejected on the basis that the added complexity was not worth the rare legitimate use.<a href="#cite_note-22">[21]</a>

The notion of multi-level breaks is of some interest in <a href="Theoretical_computer_science" title="Theoretical computer science">theoretical computer science</a>, because it gives rise to what is today called the Kosaraju hierarchy.<a href="#cite_note-kozen-23">[22]</a> In 1973 <a href="S._Rao_Kosaraju" title="S. Rao Kosaraju">S. Rao Kosaraju</a> refined the <a href="Structured_program_theorem" title="Structured program theorem">structured program theorem</a> by proving that it is possible to avoid adding additional variables in structured programming, as long as arbitrary-depth, multi-level breaks from loops are allowed.<a href="#cite_note-24">[23]</a> Furthermore, Kosaraju proved that a strict hierarchy of programs exists: for every integer n, there exists a program containing a multi-level break of depth n that cannot be rewritten as a program with multi-level breaks of depth less than n without introducing added variables.<a href="#cite_note-kozen-23">[22]</a>

In his 2004 textbook, <a href="David_Watt_(computer_scientist)" title="David Watt (computer scientist)">David Watt</a> uses Tennent's notion of <a href="S-algol" title="S-algol">sequencer</a> to explain the similarity between multi-level breaks and return statements. Watt notes that a class of sequencers known as escape sequencers, defined as "sequencer that terminates execution of a textually enclosing command or procedure", encompasses both breaks from loops (including multi-level breaks) and return statements. As commonly implemented, however, return sequencers may also carry a (return) value, whereas the break sequencer as implemented in contemporary languages usually cannot.<a href="#cite_note-WattFindlay2004b-25">[24]</a>

<div class="mw-heading mw-heading3"><h3 id="Loop_with_test_in_the_middle">Loop with test in the middle</h3></div>

The following structure was proposed by <a href="Ole-Johan_Dahl" title="Ole-Johan Dahl">Dahl</a> in 1972:<a href="#cite_note-26">[25]</a>

<pre> loop loop

xxx1 read(char);

while test; while not atEndOfFile;

xxx2 write(char);

repeat; repeat;

</pre>

The construction here can be thought of as a do loop with the while check in the middle, which allows clear <a href="#Loop-and-a-half">loop-and-a-half</a> logic. Further, by omitting individual components, this single construction can replace several constructions in most programming languages. If xxx1 is omitted, we get a loop with the test at the top (a traditional while loop). If xxx2 is omitted, we get a loop with the test at the bottom, equivalent to a do while loop in many languages. If while is omitted, we get an infinite loop. This construction also allows keeping the same polarity of the condition even when in the middle, unlike early exit, which requires reversing the polarity (adding a not),<a href="#cite_note-FOOTNOTEKnuth1974279-17">[16]</a> functioning as until instead of while.

This structure is not widely supported, with most languages instead using if ... break for conditional early exit.

This is supported by some languages, such as <a href="Forth_(programming_language)" title="Forth (programming language)">Forth</a>, where the syntax is BEGIN ... WHILE ... REPEAT,<a href="#cite_note-27">[26]</a> and the <a href="Shell_script" title="Shell script">shell script</a> languages <a href="Bourne_shell" title="Bourne shell">Bourne shell</a> (<code>sh</code>) and <a href="Bash_(Unix_shell)" title="Bash (Unix shell)">bash</a>, where the syntax is while ... do ... done or until ... do ... done, as:<a href="#cite_note-28">[27]</a><a href="#cite_note-29">[28]</a>

<div class="mw-highlight mw-highlight-lang-bash mw-content-ltr" dir="ltr"><pre>while

statement-1

statement-2

...

condition

do

statement-a

statement-b

...

done

</pre></div>

The shell syntax works because the while (or until) loop accepts a list of commands as a condition,<a href="#cite_note-30">[29]</a> formally:

<pre> while test-commands; do consequent-commands; done

</pre>

The value (exit status) of the list of test-commands is the value of the last command, and these can be separated by newlines, resulting in the idiomatic form above.

Similar constructions are possible in C and C++ with the <a href="Comma_operator" title="Comma operator">comma operator</a>, and <a href="Comma_operator#Other_languages" title="Comma operator">other languages with similar constructs</a>, which allow shoehorning a list of statements into the while condition:

<div class="mw-highlight mw-highlight-lang-c mw-content-ltr" dir="ltr"><pre>while (

statement_1,

statement_2,

condition

) {

statement_a;

statement_b;

}

</pre></div>

While legal, this is marginal, and it is primarily used, if at all, only for short modify-then-test cases, as in:<a href="#cite_note-31">[30]</a>

<div class="mw-highlight mw-highlight-lang-c mw-content-ltr" dir="ltr"><pre>while (read_string(s), strlen(s) > 0) {

// ...

}

</pre></div>

<div class="mw-heading mw-heading3"><h3 id="Loop_variants_and_invariants">Loop variants and invariants</h3></div>

<a href="Loop_variant" title="Loop variant">Loop variants</a> and <a href="Loop_invariant" title="Loop invariant">loop invariants</a> are used to express correctness of loops.<a href="#cite_note-32">[31]</a>

In practical terms, a loop variant is an integer expression which has an initial non-negative value. The variant's value must decrease during each loop iteration but must never become negative during the correct execution of the loop. Loop variants are used to guarantee that loops will terminate.

A loop invariant is an assertion which must be true before the first loop iteration and remain true after each iteration. This implies that when a loop terminates correctly, both the exit condition and the loop invariant are satisfied. Loop invariants are used to monitor specific properties of a loop during successive iterations.

Some programming languages, such as <a href="Eiffel_(programming_language)" title="Eiffel (programming language)">Eiffel</a> contain native support for loop variants and invariants. In other cases, support is an add-on, such as the <a href="Java_Modeling_Language" title="Java Modeling Language">Java Modeling Language</a>'s specification for <a rel="nofollow" class="external text" href="http://www.eecs.ucf.edu/~leavens/JML//jmlrefman/jmlrefman_12.html#SEC168">loop statements</a> in <a href="Java_(programming_language)" title="Java (programming language)">Java</a>.

<div class="mw-heading mw-heading3"><h3 id="Loop_sublanguage">Loop sublanguage</h3></div>

Some <a href="Lisp_(programming_language)" title="Lisp (programming language)">Lisp</a> dialects provide an extensive sublanguage for describing Loops. An early example can be found in Conversional Lisp of <a href="Interlisp" title="Interlisp">Interlisp</a>. <a href="Common_Lisp" title="Common Lisp">Common Lisp</a><a href="#cite_note-33">[32]</a> provides a Loop macro which implements such a sublanguage.

<div class="mw-heading mw-heading3"><h3 id="Loop_system_cross-reference_table">Loop system cross-reference table</h3></div>

<th rowspan="2"><a href="Programming_language" title="Programming language">Programming language</a>

</th>

<th colspan="3">conditional

</th>

<th colspan="4">loop

</th>

<th rowspan="2">early exit

</th>

<th rowspan="2">loop continuation

</th>

<th rowspan="2">redo

</th>

<th rowspan="2">retry

</th>

<th colspan="2">correctness facilities

</th></tr>

<tr>

<th>begin

</th>

<th>middle

</th>

<th>end

</th>

<th>count

</th>

<th>collection

</th>

<th>general

</th>

<th>infinite <style data-mw-deduplicate="TemplateStyles:r1041539562">

/* start https://en.wikipedia.org/ */

.mw-parser-output .citation{word-wrap:break-word}.mw-parser-output .citation:target{background-color:rgba(0,127,255,0.133)}

/* end https://en.wikipedia.org/ */

</style><a href="#endnote_loop_infinitea">[1]</a>

</th>

<th>variant

</th>

<th>invariant

</th></tr>

<tr>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFB; color:black;vertical-align:middle;text-align:center;" class="table-partial">arrays

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">deep nested

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td>

</td>

<td>

</td>

<td>

</td>

<td>

</td></tr>

<tr>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFB; color:black;vertical-align:middle;text-align:center;" class="table-partial">deep nested <a href="#endnote_deep_break_ca">[3]</a>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td>

</td>

<td>

</td></tr>

<tr>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td>

</td>

<td>

</td>

<td>

</td></tr>

<tr>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

</td>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td>

</td>

<td>

</td>

<td>

</td></tr>

<tr>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td>

</td>

<td>

</td>

<td>

</td>

<td>

</td></tr>

<tr>

<td><a href="COBOL" title="COBOL">COBOL</a>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFB; color:black;vertical-align:middle;text-align:center;" class="table-partial">deep nested <a href="#endnote_cobol_deep_exita">[15]</a>

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td>

</td>

<td>

</td>

<td>

</td></tr>

<tr>

<td><a href="Common_Lisp" title="Common Lisp">Common Lisp</a>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFB; color:black;vertical-align:middle;text-align:center;" class="table-partial">builtin only <a href="#endnote_cl_sequence_typea">[16]</a>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">deep nested

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td>

</td>

<td>

</td>

<td>

</td>

<td>

</td></tr>

<tr>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">deep nested

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">deep nested

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td>

</td>

<td>

</td>

<td>

</td></tr>

<tr>

<td><a href="Eiffel_(programming_language)" title="Eiffel (programming language)">Eiffel</a>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFB; color:black;vertical-align:middle;text-align:center;" class="table-partial">one level <a href="#endnote_count_loop_eiffela">[10]</a>

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

</td>

<td style="background:#FFB; color:black;vertical-align:middle;text-align:center;" class="table-partial">integer only <a href="#endnote_integer_varianta">[13]</a>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td></tr>

<tr>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td>

</td>

<td>

</td>

<td>

</td></tr>

<tr>

<td><a href="FORTRAN_77" class="mw-redirect" title="FORTRAN 77">FORTRAN 77</a>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFB; color:black;vertical-align:middle;text-align:center;" class="table-partial">one level

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td>

</td>

<td>

</td></tr>

<tr>

<td><a href="Fortran_90" class="mw-redirect" title="Fortran 90">Fortran 90</a>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">deep nested

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">deep nested

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td>

</td>

<td>

</td></tr>

<tr>

<td><a href="Fortran_95" class="mw-redirect" title="Fortran 95">Fortran 95</a> and later

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFB; color:black;vertical-align:middle;text-align:center;" class="table-partial">arrays

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">deep nested

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">deep nested

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td>

</td>

<td>

</td></tr>

<tr>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFB; color:black;vertical-align:middle;text-align:center;" class="table-partial">builtin only

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">deep nested

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">deep nested

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td>

</td>

<td>

</td>

<td>

</td></tr>

<tr>

<td><a href="Haskell" title="Haskell">Haskell</a>

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td>

</td>

<td>

</td>

<td>

</td></tr>

<tr>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">deep nested

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">deep nested

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">non-native <a href="#endnote_requires_JMLa">[12]</a>

</td>

</td></tr>

<tr>

<td><a href="JavaScript" title="JavaScript">JavaScript</a>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">deep nested

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">deep nested

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td>

</td>

<td>

</td></tr>

<tr>

<td>Natural

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td>

</td></tr>

<tr>

<td><a href="OCaml" title="OCaml">OCaml</a>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">arrays,lists

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td>

</td>

<td>

</td>

<td>

</td></tr>

<tr>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

</td>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">deep nested

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">deep nested

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td>

</td>

<td>

</td>

<td>

</td></tr>

<tr>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">deep nested

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">deep nested

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td>

</td>

<td>

</td>

<td>

</td></tr>

<tr>

<td><a href="Python_(programming_language)" title="Python (programming language)">Python</a>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td>

</td>

<td>

</td>

<td>

</td></tr>

<tr>

<td><a href="Rebol" title="Rebol">Rebol</a>

</td>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFB; color:black;vertical-align:middle;text-align:center;" class="table-partial">one level <a href="#endnote_deep_break_ed">[6]</a>

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td>

</td>

<td>

</td>

<td>

</td></tr>

<tr>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td>

</td>

<td>

</td></tr>

<tr>

<td><a href="Standard_ML" title="Standard ML">Standard ML</a>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">arrays,lists

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td>

</td>

<td>

</td>

<td>

</td></tr>

<tr>

<td><a href="Visual_Basic_.NET" class="mw-redirect" title="Visual Basic .NET">Visual Basic .NET</a>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFB; color:black;vertical-align:middle;text-align:center;" class="table-partial">one level per type of loop

</td>

<td style="background:#FFB; color:black;vertical-align:middle;text-align:center;" class="table-partial">one level per type of loop

</td>

<td>

</td>

<td>

</td>

<td>

</td>

<td>

</td></tr>

<tr>

<td><a href="PowerShell" title="PowerShell">PowerShell</a>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td>

</td>

<td>

</td>

<td>

</td>

<td>

</td></tr></tbody></table>

<ol><li><a href="#ref_loop_infinitea">a</a> <code>while (true)</code> does not count as an infinite loop for this purpose, because it is not a dedicated language structure.</li>

<li><a href="#ref_loop_fora">a</a> <a href="#ref_loop_forb">b</a> <a href="#ref_loop_forc">c</a> <a href="#ref_loop_ford">d</a> <a href="#ref_loop_fore">e</a> <a href="#ref_loop_forf">f</a> <a href="#ref_loop_forg">g</a> <a href="#ref_loop_forh">h</a> C's <code>for (init; test; increment)</code> loop is a general loop construct, not specifically a counting one, although it is often used for that.</li>

<li><a href="#ref_deep_break_ca">a</a> <a href="#ref_deep_break_cb">b</a> <a href="#ref_deep_break_cc">c</a> Deep breaks may be accomplished in APL, C, C++ and C# through the use of labels and gotos.</li>

<li><a href="#ref_loop_phpforeacha">a</a> Iteration over objects was <a rel="nofollow" class="external text" href="http://www.php.net/manual/en/language.oop5.iterations.php">added</a> in PHP 5.</li>

<li><a href="#ref_loop_rangea">a</a> <a href="#ref_loop_rangeb">b</a> <a href="#ref_loop_rangec">c</a> A counting loop can be simulated by iterating over an incrementing list or generator, for instance, Python's <code>range()</code>.</li>

<li><a href="#ref_deep_break_ea">a</a> <a href="#ref_deep_break_eb">b</a> <a href="#ref_deep_break_ec">c</a> <a href="#ref_deep_break_ed">d</a> <a href="#ref_deep_break_ee">e</a> Deep breaks may be accomplished through the use of exception handling.</li>

<li><a href="#ref_whilea">a</a> There is no special construct, since the <code>while</code> function can be used for this.</li>

<li><a href="#ref_usera">a</a> There is no special construct, but users can define general loop functions.</li>

<li><a href="#ref_loop_foreacha">a</a> The <a href="C%2B%2B11" title="C++11">C++11</a> standard introduced the <a href="C%2B%2B11#Range-based_for_loop" title="C++11">range-based for</a>. In the <a href="Standard_Template_Library" title="Standard Template Library">STL</a>, there is a <code>std::for_each</code> <a href="Template_(programming)" class="mw-redirect" title="Template (programming)">template</a> function which can iterate on STL <a href="Container_(data_structure)" class="mw-redirect" title="Container (data structure)">containers</a> and call a <a href="Unary_function" title="Unary function">unary function</a> for each element.<a href="#cite_note-34">[33]</a> The functionality also can be constructed as <a href="C_preprocessor#Macro_definition_and_expansion" title="C preprocessor">macro</a> on these containers.<a href="#cite_note-35">[34]</a></li>

<li><a href="#ref_count_loop_eiffela">a</a> Count-controlled looping is effected by iteration across an integer interval; early exit by including an additional condition for exit.</li>

<li><a href="#ref_retry_in_eiffela">a</a> Eiffel supports a reserved word <code>retry</code>, however it is used in <a href="Exception_handling#Exception_handling_based_on_design_by_contract" title="Exception handling">exception handling</a>, not loop control.</li>

<li><a href="#ref_requires_JMLa">a</a> Requires <a href="Java_Modeling_Language" title="Java Modeling Language">Java Modeling Language</a> (JML) behavioral interface specification language.</li>

<li><a href="#ref_integer_varianta">a</a> Requires loop variants to be integers; transfinite variants are not supported. <a rel="nofollow" class="external text" href="http://archive.eiffel.com/doc/faq/variant.html">Eiffel: Why loop variants are integers</a></li>

<li><a href="#ref_DInfinitea">a</a> D supports infinite collections, and the ability to iterate over those collections. This does not require any special construct.</li>

<li><a href="#ref_cobol_deep_exita">a</a> Deep breaks can be achieved using <code>GO TO</code> and procedures.</li>

<li><a href="#ref_cl_sequence_typea">a</a> Common Lisp predates the concept of generic collection type.</li></ol>

<div class="mw-heading mw-heading2"><h2 id="Structured_non-local_control_flow">Structured non-local control flow</h2></div>

Many programming languages, especially those favoring more dynamic styles of programming, offer constructs for non-local control flow. These cause the flow of execution to jump out of a given context and resume at some <a href="Predeclared" title="Predeclared">predeclared</a> point. <a href="Exception_handling#Condition_systems" title="Exception handling">Conditions</a>, <a href="Exception_handling" title="Exception handling">exceptions</a> and <a href="Continuation" title="Continuation">continuations</a> are three common sorts of non-local control constructs; more exotic ones also exist, such as <a href="Generator_(computer_programming)" title="Generator (computer programming)">generators</a>, <a href="Coroutine" title="Coroutine">coroutines</a> and the <a href="Futures_and_promises" title="Futures and promises">async</a> keyword.

<div class="mw-heading mw-heading3"><h3 id="Conditions">Conditions</h3></div>

The earliest <a href="Fortran" title="Fortran">Fortran</a> compilers had statements for testing exceptional conditions. These included the <code>IF ACCUMULATOR OVERFLOW</code>, <code>IF QUOTIENT OVERFLOW</code>, and <code>IF DIVIDE CHECK</code> statements. In the interest of machine independence, they were not included in FORTRAN IV and the Fortran 66 Standard. However since Fortran 2003 it is possible to test for numerical issues via calls to functions in the <code>IEEE_EXCEPTIONS</code> module.

<a href="PL/I" title="PL/I">PL/I</a> has some 22 standard conditions (e.g., ZERODIVIDE SUBSCRIPTRANGE ENDFILE) which can be raised and which can be intercepted by: ON condition action; Programmers can also define and use their own named conditions.

Like the unstructured if, only one statement can be specified so in many cases a GOTO is needed to decide where flow of control should resume.

Unfortunately, some implementations had a substantial overhead in both space and time (especially SUBSCRIPTRANGE), so many programmers tried to avoid using conditions.

Common Syntax examples:

<pre> ON condition GOTO label

</pre>

<div class="mw-heading mw-heading3"><h3 id="Exceptions">Exceptions</h3></div>

<div role="note" class="hatnote navigation-not-searchable">Main article: <a href="Exception_handling" title="Exception handling">Exception handling</a></div>

Modern languages have a specialized structured construct for exception handling which does not rely on the use of <code>GOTO</code> or (multi-level) breaks or returns. For example, in C++ one can write:

<div class="mw-highlight mw-highlight-lang-cpp mw-content-ltr" dir="ltr"><pre>try {

xxx1 // Somewhere in here

xxx2 // use: '''throw''' someValue;

xxx3

} catch (someClass& someId) { // catch value of someClass

actionForSomeClass

} catch (someType& anotherId) { // catch value of someType

actionForSomeType

} catch (...) { // catch anything not already caught

actionForAnythingElse

}

</pre></div>

Any number and variety of <code>catch</code> clauses can be used above. If there is no <code>catch</code> matching a particular <code>throw</code>, control percolates back through subroutine calls and/or nested blocks until a matching <code>catch</code> is found or until the end of the main program is reached, at which point the program is forcibly stopped with a suitable error message.

Via C++'s influence, <code>catch</code> is the keyword reserved for declaring a pattern-matching exception handler in other languages popular today, like Java or C#. Some other languages like Ada use the keyword <code>exception</code> to introduce an exception handler and then may even employ a different keyword (<code>when</code> in Ada) for the pattern matching. A few languages like <a href="AppleScript" title="AppleScript">AppleScript</a> incorporate placeholders in the exception handler syntax to automatically extract several pieces of information when the exception occurs. This approach is exemplified below by the <code>on error</code> construct from AppleScript:

<div class="mw-highlight mw-highlight-lang-applescript mw-content-ltr" dir="ltr"><pre>try

set myNumber to myNumber / 0

on error e number n from f to t partial result pr

if ( e = "Can't divide by zero" ) then display dialog "You must not do that"

end try

</pre></div>

David Watt's 2004 textbook also analyzes exception handling in the framework of sequencers (introduced in this article in the section on early exits from loops). Watt notes that an abnormal situation, generally exemplified with arithmetic overflows or <a href="Input/output" title="Input/output">input/output</a> failures like file not found, is a kind of error that "is detected in some low-level program unit, but [for which] a handler is more naturally located in a high-level program unit". For example, a program might contain several calls to read files, but the action to perform when a file is not found depends on the meaning (purpose) of the file in question to the program and thus a handling routine for this abnormal situation cannot be located in low-level system code. Watts further notes that introducing status flags testing in the caller, as single-exit structured programming or even (multi-exit) return sequencers would entail, results in a situation where "the application code tends to get cluttered by tests of status flags" and that "the programmer might forgetfully or lazily omit to test a status flag. In fact, abnormal situations represented by status flags are by default ignored!" Watt notes that in contrast to status flags testing, exceptions have the opposite <a href="Default_(computer_science)" title="Default (computer science)">default behavior</a>, causing the program to terminate unless the program deals with the exception explicitly in some way, possibly by adding explicit code to ignore it. Based on these arguments, Watt concludes that jump sequencers or escape sequencers are less suitable as a dedicated exception sequencer with the semantics discussed above.<a href="#cite_note-36">[35]</a>

In Object Pascal, D, Java, C#, and Python a <code>finally</code> clause can be added to the <code>try</code> construct. No matter how control leaves the <code>try</code> the code inside the <code>finally</code> clause is guaranteed to execute. This is useful when writing code that must relinquish an expensive resource (such as an opened file or a database connection) when finished processing:

<div class="mw-highlight mw-highlight-lang-csharp mw-content-ltr" dir="ltr"><pre>FileStream stm = null; // C# example

try

{

stm = new FileStream("logfile.txt", FileMode.Create);

return ProcessStuff(stm); // may throw an exception

}

finally

{

if (stm != null)

stm.Close();

}

</pre></div>

Since this pattern is fairly common, C# has a special syntax:

<div class="mw-highlight mw-highlight-lang-csharp mw-content-ltr" dir="ltr"><pre>using (var stm = new FileStream("logfile.txt", FileMode.Create))

{

}

</pre></div>

Upon leaving the <code>using</code>-block, the compiler guarantees that the <code>stm</code> object is released, effectively <a href="Name_binding" title="Name binding">binding</a> the variable to the file stream while abstracting from the side effects of initializing and releasing the file. Python's <code>with</code> statement and Ruby's block argument to <code>File.open</code> are used to similar effect.

All the languages mentioned above define standard exceptions and the circumstances under which they are thrown. Users can throw exceptions of their own; C++ allows users to throw and catch almost any type, including basic types like <code>int</code>, whereas other languages like Java are less permissive.

<div class="mw-heading mw-heading3"><h3 id="Continuations">Continuations</h3></div>

<div role="note" class="hatnote navigation-not-searchable">Main article: <a href="Continuation" title="Continuation">Continuation</a></div>

<div class="mw-heading mw-heading3"><h3 id="Async">Async</h3></div>

C# 5.0 introduced the async keyword for supporting <a href="Asynchronous_I/O" title="Asynchronous I/O">asynchronous I/O</a> in a "direct style".

<div class="mw-heading mw-heading3"><h3 id="Generators">Generators</h3></div>

<div role="note" class="hatnote navigation-not-searchable">Main article: <a href="Generator_(computer_science)" class="mw-redirect" title="Generator (computer science)">Generator (computer science)</a></div>

<a href="Generator_(computer_science)" class="mw-redirect" title="Generator (computer science)">Generators</a>, also known as semicoroutines, allow control to be yielded to a consumer method temporarily, typically using a <code class="mw-highlight mw-highlight-lang-python mw-content-ltr" dir="ltr">yield</code> keyword (<a rel="nofollow" class="external text" href="https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Operators/yield">yield description</a>) . Like the async keyword, this supports programming in a "direct style".

<div class="mw-heading mw-heading3"><h3 id="Coroutines">Coroutines</h3></div>

<div role="note" class="hatnote navigation-not-searchable">Main article: <a href="Coroutine" title="Coroutine">Coroutine</a></div>

<a href="Coroutines" class="mw-redirect" title="Coroutines">Coroutines</a> are functions that can yield control to each other - a form of <a href="Co-operative_multitasking" class="mw-redirect" title="Co-operative multitasking">co-operative multitasking</a> without threads.

Coroutines can be implemented as a library if the programming language provides either continuations or generators - so the distinction between coroutines and generators in practice is a technical detail.

<div class="mw-heading mw-heading3"><h3 id="Non-local_control_flow_cross_reference">Non-local control flow cross reference</h3></div>

<th><a href="Programming_language" title="Programming language">Programming language</a>

</th>

<th>conditions

</th>

<th>exceptions

</th>

<th>generators/coroutines

</th>

<th>async

</th></tr>

<tr>

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background: var(--background-color-interactive, #EEE); color: var(--color-base, black); vertical-align: middle; white-space: nowrap; text-align: center;" class="table-Unknown">?

</td>

<td style="background: var(--background-color-interactive, #EEE); color: var(--color-base, black); vertical-align: middle; white-space: nowrap; text-align: center;" class="table-Unknown">?

</td></tr>

<tr>

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td></tr>

<tr>

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td></tr>

<tr>

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background: var(--background-color-interactive, #EEE); color: var(--color-base, black); vertical-align: middle; white-space: nowrap; text-align: center;" class="table-Unknown">?

</td></tr>

<tr>

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td></tr>

<tr>

<td><a href="COBOL" title="COBOL">COBOL</a>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td></tr>

<tr>

<td><a href="Common_Lisp" title="Common Lisp">Common Lisp</a>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background: var(--background-color-interactive, #EEE); color: var(--color-base, black); vertical-align: middle; white-space: nowrap; text-align: center;" class="table-Unknown">?

</td>

<td style="background: var(--background-color-interactive, #EEE); color: var(--color-base, black); vertical-align: middle; white-space: nowrap; text-align: center;" class="table-Unknown">?

</td></tr>

<tr>

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background: var(--background-color-interactive, #EEE); color: var(--color-base, black); vertical-align: middle; white-space: nowrap; text-align: center;" class="table-Unknown">?

</td></tr>

<tr>

<td><a href="Eiffel_(programming_language)" title="Eiffel (programming language)">Eiffel</a>

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background: var(--background-color-interactive, #EEE); color: var(--color-base, black); vertical-align: middle; white-space: nowrap; text-align: center;" class="table-Unknown">?

</td>

<td style="background: var(--background-color-interactive, #EEE); color: var(--color-base, black); vertical-align: middle; white-space: nowrap; text-align: center;" class="table-Unknown">?

</td></tr>

<tr>

<td><a href="Erlang_(programming_language)" title="Erlang (programming language)">Erlang</a>

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background: var(--background-color-interactive, #EEE); color: var(--color-base, black); vertical-align: middle; white-space: nowrap; text-align: center;" class="table-Unknown">?

</td></tr>

<tr>

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td></tr>

<tr>

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background: var(--background-color-interactive, #EEE); color: var(--color-base, black); vertical-align: middle; white-space: nowrap; text-align: center;" class="table-Unknown">?

</td></tr>

<tr>

<td><a href="Haskell" title="Haskell">Haskell</a>

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td></tr>

<tr>

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td></tr>

<tr>

<td><a href="JavaScript" title="JavaScript">JavaScript</a>

</td>

<td style="background: var(--background-color-interactive, #EEE); color: var(--color-base, black); vertical-align: middle; white-space: nowrap; text-align: center;" class="table-Unknown">?

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td></tr>

<tr>

<td><a href="Objective-C" title="Objective-C">Objective-C</a>

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background: var(--background-color-interactive, #EEE); color: var(--color-base, black); vertical-align: middle; white-space: nowrap; text-align: center;" class="table-Unknown">?

</td></tr>

<tr>

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background: var(--background-color-interactive, #EEE); color: var(--color-base, black); vertical-align: middle; white-space: nowrap; text-align: center;" class="table-Unknown">?

</td></tr>

<tr>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td></tr>

<tr>

<td><a href="Python_(programming_language)" title="Python (programming language)">Python</a>

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

</td></tr>

<tr>

<td><a href="Rebol" title="Rebol">Rebol</a>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background: var(--background-color-interactive, #EEE); color: var(--color-base, black); vertical-align: middle; white-space: nowrap; text-align: center;" class="table-Unknown">?

</td></tr>

<tr>

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">via extension<a href="#cite_note-38">[37]</a>

</td></tr>

<tr>

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">experimental <a href="#cite_note-39">[38]</a><a href="#cite_note-40">[39]</a>

</td>

</td></tr>

<tr>

<td><a href="Scala_(programming_language)" title="Scala (programming language)">Scala</a>

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">via experimental extension<a href="#cite_note-42">[41]</a>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">via experimental extension

</td></tr>

<tr>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">via traces

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">via event loop

</td></tr>

<tr>

<td><a href="Visual_Basic_.NET" class="mw-redirect" title="Visual Basic .NET">Visual Basic .NET</a>

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background: var(--background-color-interactive, #EEE); color: var(--color-base, black); vertical-align: middle; white-space: nowrap; text-align: center;" class="table-Unknown">?

</td></tr>

<tr>

<td><a href="PowerShell" title="PowerShell">PowerShell</a>

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background:#9EFF9E;color:black;vertical-align:middle;text-align:center;" class="table-yes">Yes

</td>

<td style="background:#FFC7C7;color:black;vertical-align:middle;text-align:center;" class="table-no">No

</td>

<td style="background: var(--background-color-interactive, #EEE); color: var(--color-base, black); vertical-align: middle; white-space: nowrap; text-align: center;" class="table-Unknown">?

</td></tr></tbody></table>

<div class="mw-heading mw-heading2"><h2 id="Proposed_control_structures">Proposed control structures</h2></div>

<div class="mw-heading mw-heading3"><h3 id="COMEFROM">COMEFROM</h3></div>

<div role="note" class="hatnote navigation-not-searchable">Main article: <a href="COMEFROM" title="COMEFROM">COMEFROM</a></div>

In a spoof <a href="Datamation" title="Datamation">Datamation</a> article<a href="#cite_note-43">[42]</a> in 1973, R. Lawrence Clark suggested that the GOTO statement could be replaced by the <a href="COMEFROM" title="COMEFROM">COMEFROM</a> statement, and provides some entertaining examples. COMEFROM was implemented in one <a href="Esoteric_programming_language" title="Esoteric programming language">esoteric programming language</a> named <a href="INTERCAL" title="INTERCAL">INTERCAL</a>.

<div class="mw-heading mw-heading3"><h3 id="Event-based_early_exit_from_nested_loops">Event-based early exit from nested loops</h3></div>

<a href="Zahn's_construct" title="Zahn's construct">This construct</a> was proposed by <a href="Zahn's_construct" title="Zahn's construct">Zahn</a> in 1974,<a href="#cite_note-44">[43]</a> and discussed in <a href="#CITEREFKnuth1974">Knuth (1974)</a>. A modified version is presented here.

<pre> exitwhen EventA or EventB or EventC;

xxx

exits

EventA: actionA

EventB: actionB

EventC: actionC

endexit;

</pre>

exitwhen is used to specify the events which may occur within xxx,

their occurrence is indicated by using the name of the event as a statement. When some event does occur, the relevant action is carried out, and then control passes just after endexit. This construction provides a very clear separation between determining that some situation applies, and the action to be taken for that situation.

exitwhen is conceptually similar to <a href="Exception_handling" title="Exception handling">exception handling</a>, and exceptions or similar constructs are used for this purpose in many languages.

The following simple example involves searching a two-dimensional table for a particular item.

<pre> exitwhen found or missing;

for I := 1 to N do

for J := 1 to M do

if table[I,J] = target then found;

missing;

exits

found: print ("item is in table");

missing: print ("item is not in table");

endexit;

</pre>

<div class="mw-heading mw-heading2"><h2 id="Security">Security</h2></div>

One way to attack a piece of software is to redirect the flow of execution of a program. A variety of <a href="Control-flow_integrity" title="Control-flow integrity">control-flow integrity</a> techniques, including <a href="Stack_canary" class="mw-redirect" title="Stack canary">stack canaries</a>, <a href="Buffer_overflow_protection" title="Buffer overflow protection">buffer overflow protection</a>, shadow stacks, and <a href="Virtual_method_table" title="Virtual method table">vtable</a> pointer verification, are used to defend against these attacks.<a href="#cite_note-45">[44]</a><a href="#cite_note-46">[45]</a><a href="#cite_note-47">[46]</a>

/* start https://en.wikipedia.org/ */

.mw-parser-output .div-col{margin-top:0.3em;column-width:30em}.mw-parser-output .div-col-small{font-size:90%}.mw-parser-output .div-col-rules{column-rule:1px solid #aaa}.mw-parser-output .div-col dl,.mw-parser-output .div-col ol,.mw-parser-output .div-col ul{margin-top:0}.mw-parser-output .div-col li,.mw-parser-output .div-col dd{page-break-inside:avoid;break-inside:avoid-column}

/* end https://en.wikipedia.org/ */

</style><div class="div-col">

<ul><li><a href="Branch_(computer_science)" title="Branch (computer science)">Branch (computer science)</a></li>

<li><a href="Control_flow_analysis" class="mw-redirect" title="Control flow analysis">Control-flow analysis</a></li>

<li><a href="Control-flow_diagram" title="Control-flow diagram">Control-flow diagram</a></li>

<li><a href="Control-flow_graph" title="Control-flow graph">Control-flow graph</a></li>

<li><a href="Control_table" title="Control table">Control table</a></li>

<li><a href="Coroutine" title="Coroutine">Coroutine</a></li>

<li><a href="Cyclomatic_complexity" title="Cyclomatic complexity">Cyclomatic complexity</a></li>

<li><a href="DRAKON" title="DRAKON">Drakon-chart</a></li>

<li><a href="Flowchart" title="Flowchart">Flowchart</a></li>

<li><a href="Jeroo" title="Jeroo">Jeroo</a>, helps learn control structures</li>

<li><a href="Predication_(computer_architecture)" title="Predication (computer architecture)">predication</a></li>

<li><a href="Recursion" title="Recursion">Recursion</a></li>

<li><a href="Scheduling_(computing)" title="Scheduling (computing)">Scheduling (computing)</a></li>

<li><a href="Spaghetti_code" title="Spaghetti code">Spaghetti code</a></li>

<li><a href="Structured_programming" title="Structured programming">Structured programming</a></li>

<li><a href="Subroutine" class="mw-redirect" title="Subroutine">Subroutine</a></li>

<li><a href="Switch_statement" title="Switch statement">Switch statement</a>, alters control flow conditionally</li>

<li><a href="Zahn's_construct" title="Zahn's construct">Zahn's construct</a></li></ul>

</div>

<div class="mw-heading mw-heading2"><h2 id="Notes">Notes</h2></div>

/* start https://en.wikipedia.org/ */

.mw-parser-output .reflist{margin-bottom:0.5em;list-style-type:decimal}@media screen{.mw-parser-output .reflist{font-size:90%}}.mw-parser-output .reflist .references{font-size:100%;margin-bottom:0;list-style-type:inherit}.mw-parser-output .reflist-columns-2{column-width:30em}.mw-parser-output .reflist-columns-3{column-width:25em}.mw-parser-output .reflist-columns{margin-top:0.3em}.mw-parser-output .reflist-columns ol{margin-top:0}.mw-parser-output .reflist-columns li{page-break-inside:avoid;break-inside:avoid-column}.mw-parser-output .reflist-upper-alpha{list-style-type:upper-alpha}.mw-parser-output .reflist-upper-roman{list-style-type:upper-roman}.mw-parser-output .reflist-lower-alpha{list-style-type:lower-alpha}.mw-parser-output .reflist-lower-greek{list-style-type:lower-greek}.mw-parser-output .reflist-lower-roman{list-style-type:lower-roman}

/* end https://en.wikipedia.org/ */

</style><div class="reflist reflist-lower-alpha">

<li id="cite_note-4"><a href="#cite_ref-4">^</a> In Fortran, this statement was deemed obsolescent in Fortran-90, and deleted as of Fortran 2018.

</li>

</ol></div></div>

<div class="mw-heading mw-heading2"><h2 id="References">References</h2></div>

<li id="cite_note-1"><a href="#cite_ref-1">^</a> Böhm, Jacopini. "Flow diagrams, turing machines and languages with only two formation rules" <a href="Comm._ACM" class="mw-redirect" title="Comm. ACM">Comm. ACM</a>, 9(5):366-371, May 1966.

</li>

<li id="cite_note-roberts-2">^ <a href="#cite_ref-roberts_2-0">a</a> <a href="#cite_ref-roberts_2-1">b</a> <a href="#cite_ref-roberts_2-2">c</a> <a href="#cite_ref-roberts_2-3">d</a> <a href="#cite_ref-roberts_2-4">e</a> <a href="#cite_ref-roberts_2-5">f</a> <a href="#cite_ref-roberts_2-6">g</a> Roberts, E. [1995] "<a rel="nofollow" class="external text" href="http://cs.stanford.edu/people/eroberts/papers/SIGCSE-1995/LoopExits.pdf">Loop Exits and Structured Programming: Reopening the Debate</a> <a rel="nofollow" class="external text" href="https://web.archive.org/web/20140725130816/http://cs.stanford.edu/people/eroberts/papers/SIGCSE-1995/LoopExits.pdf">Archived</a> 2014-07-25 at the <a href="Wayback_Machine" title="Wayback Machine">Wayback Machine</a>," ACM SIGCSE Bulletin, (27)1: 268–272.

</li>

/* start https://en.wikipedia.org/ */

.mw-parser-output cite.citation{font-style:inherit;word-wrap:break-word}.mw-parser-output .citation q{quotes:"\"""\"""'""'"}.mw-parser-output .citation:target{background-color:rgba(0,127,255,0.133)}.mw-parser-output .id-lock-free.id-lock-free a{background:url("./mw/Lock-green.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-limited.id-lock-limited a,.mw-parser-output .id-lock-registration.id-lock-registration a{background:url("./mw/Lock-gray-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .id-lock-subscription.id-lock-subscription a{background:url("./mw/Lock-red-alt-2.svg")right 0.1em center/9px no-repeat}.mw-parser-output .cs1-ws-icon a{background:url("./mw/Wikisource-logo.svg")right 0.1em center/12px no-repeat}body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-free a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-limited a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-registration a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .id-lock-subscription a,body:not(.skin-timeless):not(.skin-minerva) .mw-parser-output .cs1-ws-icon a{background-size:contain;padding:0 1em 0 0}.mw-parser-output .cs1-code{color:inherit;background:inherit;border:none;padding:inherit}.mw-parser-output .cs1-hidden-error{display:none;color:var(--color-error,#d33)}.mw-parser-output .cs1-visible-error{color:var(--color-error,#d33)}.mw-parser-output .cs1-maint{display:none;color:#085;margin-left:0.3em}.mw-parser-output .cs1-kern-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right{padding-right:0.2em}.mw-parser-output .citation .mw-selflink{font-weight:inherit}@media screen{.mw-parser-output .cs1-format{font-size:95%}html.skin-theme-clientpref-night .mw-parser-output .cs1-maint{color:#18911f}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .cs1-maint{color:#18911f}}

/* end https://en.wikipedia.org/ */

</style><cite id="CITEREFDavid_Anthony_WattWilliam_Findlay2004" class="citation book cs1">David Anthony Watt; William Findlay (2004). Programming language design concepts. John Wiley & Sons. p. 228. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>978-0-470-85320-7</bdi>.</cite>

</li>

<li id="cite_note-5"><a href="#cite_ref-5">^</a> <cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www.geeksforgeeks.org/nested-loops-in-c-with-examples/">"Nested Loops in C with Examples"</a>. GeeksforGeeks. 2019-11-25. Retrieved 2024-03-14.</cite>

</li>

<li id="cite_note-6"><a href="#cite_ref-6">^</a> <cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www.w3schools.com/python/gloss_python_for_nested.asp">"Python Nested Loops"</a>. www.w3schools.com. Retrieved 2024-03-14.</cite>

</li>

<li id="cite_note-7"><a href="#cite_ref-7">^</a> <cite id="CITEREFDean2019" class="citation web cs1">Dean, Jenna (2019-11-22). <a rel="nofollow" class="external text" href="https://medium.com/swlh/nested-loops-ee1dbb9fc8ab">"Nested Loops"</a>. The Startup. Retrieved 2024-03-14.</cite>

</li>

<li id="cite_note-8"><a href="#cite_ref-8">^</a> <cite id="CITEREFKnuth1974" class="citation journal cs1"><a href="Donald_Knuth" title="Donald Knuth">Knuth, Donald E.</a> (1974). "Structured Programming with <code>go to</code> Statements". <a href="ACM_Computing_Surveys" title="ACM Computing Surveys">Computing Surveys</a>. 6 (4): 261–301. <a href="CiteSeerX_(identifier)" class="mw-redirect" title="CiteSeerX (identifier)">CiteSeerX</a> <a rel="nofollow" class="external text" href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.6084">10.1.1.103.6084</a>. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1145%2F356635.356640">10.1145/356635.356640</a>. <a href="S2CID_(identifier)" class="mw-redirect" title="S2CID (identifier)">S2CID</a> <a rel="nofollow" class="external text" href="https://api.semanticscholar.org/CorpusID:207630080">207630080</a>.</cite>

</li>

<li id="cite_note-9"><a href="#cite_ref-9">^</a> <a href="https://en.wikibooks.org/wiki/Ada_Programming/Control#Endless_Loop" class="extiw external" title="b:Ada Programming/Control">Ada Programming: Control: Endless Loop</a>

</li>

<li id="cite_note-10"><a href="#cite_ref-10">^</a> <cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://web.archive.org/web/20200728081722/http://www.megacpptutorials.com/2012/12/what-is-loop.html">"What is a loop and how we can use them?"</a>. Archived from <a rel="nofollow" class="external text" href="http://www.megacpptutorials.com/2012/12/what-is-loop.html">the original</a> on 2020-07-28. Retrieved 2020-05-25.</cite>

</li>

<li id="cite_note-11"><a href="#cite_ref-11">^</a> <cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://perldoc.perl.org/functions/redo.html">"redo - perldoc.perl.org"</a>. perldoc.perl.org. Retrieved 2020-09-25.</cite>

</li>

<li id="cite_note-12"><a href="#cite_ref-12">^</a> <cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://docs.ruby-lang.org/en/2.4.0/syntax/control_expressions_rdoc.html">"control_expressions - Documentation for Ruby 2.4.0"</a>. docs.ruby-lang.org. Retrieved 2020-09-25.</cite>

</li>

<li id="cite_note-13"><a href="#cite_ref-13">^</a> <cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://docs.ruby-lang.org/en/2.3.0/syntax/control_expressions_rdoc.html">"control_expressions - Documentation for Ruby 2.3.0"</a>. docs.ruby-lang.org. Retrieved 2020-09-25.</cite>

</li>

<li id="cite_note-c2messy-14">^ <a href="#cite_ref-c2messy_14-0">a</a> <a href="#cite_ref-c2messy_14-1">b</a> <cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://wiki.c2.com/?MessyLoopConditions">"Messy Loop Conditions"</a>. WikiWikiWeb. 2014-11-03.</cite>

</li>

<li id="cite_note-FOOTNOTEKnuth1974278Simple_Iterations-15">^ <a href="#cite_ref-FOOTNOTEKnuth1974278Simple_Iterations_15-0">a</a> <a href="#cite_ref-FOOTNOTEKnuth1974278Simple_Iterations_15-1">b</a> <a href="#cite_ref-FOOTNOTEKnuth1974278Simple_Iterations_15-2">c</a> <a href="#CITEREFKnuth1974">Knuth 1974</a>, p. 278, Simple Iterations.

</li>

<li id="cite_note-16"><a href="#cite_ref-16">^</a> <a href="Edsger_W._Dijkstra" title="Edsger W. Dijkstra">Edsger W. Dijkstra</a>, personal communication to <a href="Donald_Knuth" title="Donald Knuth">Donald Knuth</a> on 1974-01-03, cited in <a href="#CITEREFKnuth1974">Knuth (1974</a>, p. 278, Simple Iterations)

</li>

<li id="cite_note-FOOTNOTEKnuth1974279-17">^ <a href="#cite_ref-FOOTNOTEKnuth1974279_17-0">a</a> <a href="#cite_ref-FOOTNOTEKnuth1974279_17-1">b</a> <a href="#cite_ref-FOOTNOTEKnuth1974279_17-2">c</a> <a href="#CITEREFKnuth1974">Knuth 1974</a>, p. 279.

</li>

<li id="cite_note-18"><a href="#cite_ref-18">^</a> Advanced Bash Scripting Guide: <a rel="nofollow" class="external text" href="http://tldp.org/LDP/abs/html/loopcontrol.html">11.3. Loop Control</a>

</li>

<li id="cite_note-19"><a href="#cite_ref-19">^</a> PHP Manual: "<a rel="nofollow" class="external text" href="http://php.net/manual/en/control-structures.break.php">break</a>"

</li>

<li id="cite_note-20"><a href="#cite_ref-20">^</a> perldoc: <a rel="nofollow" class="external text" href="http://perldoc.perl.org/functions/last.html">last</a>

</li>

<li id="cite_note-21"><a href="#cite_ref-21">^</a> comp.lang.c FAQ list · "<a rel="nofollow" class="external text" href="http://c-faq.com/misc/multibreak.html">Question 20.20b</a>"

</li>

<li id="cite_note-22"><a href="#cite_ref-22">^</a> <a rel="nofollow" class="external text" href="http://mail.python.org/pipermail/python-3000/2007-July/008663.html">[Python-3000] Announcing PEP 3136</a>, Guido van Rossum

</li>

<li id="cite_note-kozen-23">^ <a href="#cite_ref-kozen_23-0">a</a> <a href="#cite_ref-kozen_23-1">b</a> <cite id="CITEREFKozen2008" class="citation book cs1">Kozen, Dexter (2008). "The Böhm–Jacopini Theorem is False, Propositionally". <a rel="nofollow" class="external text" href="http://www.cs.cornell.edu/~kozen/papers/BohmJacopini.pdf">Mathematics of Program Construction</a> (PDF). Lecture Notes in Computer Science. Vol. 5133. pp. 177–192. <a href="CiteSeerX_(identifier)" class="mw-redirect" title="CiteSeerX (identifier)">CiteSeerX</a> <a rel="nofollow" class="external text" href="https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.218.9241">10.1.1.218.9241</a>. <a href="Doi_(identifier)" class="mw-redirect" title="Doi (identifier)">doi</a>:<a rel="nofollow" class="external text" href="https://doi.org/10.1007%2F978-3-540-70594-9_11">10.1007/978-3-540-70594-9_11</a>. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>978-3-540-70593-2</bdi>.</cite>

</li>

<li id="cite_note-24"><a href="#cite_ref-24">^</a> Kosaraju, S. Rao. "Analysis of structured programs," Proc. Fifth Annual ACM Syrup.

Theory of Computing, (May 1973), 240-252; also in J. Computer and System Sciences, 9,

3 (December 1974), cited by <a href="#CITEREFKnuth1974">Knuth (1974)</a>.

</li>

<li id="cite_note-WattFindlay2004b-25"><a href="#cite_ref-WattFindlay2004b_25-0">^</a> <cite id="CITEREFDavid_Anthony_WattWilliam_Findlay2004" class="citation book cs1">David Anthony Watt; William Findlay (2004). Programming language design concepts. John Wiley & Sons. pp. 215–221. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>978-0-470-85320-7</bdi>.</cite>

</li>

<li id="cite_note-26"><a href="#cite_ref-26">^</a> Dahl & Dijkstra & Hoare, "Structured Programming" Academic Press, 1972.

</li>

<li id="cite_note-27"><a href="#cite_ref-27">^</a> <cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://www.forth.com/starting-forth/6-forth-do-loops/">"6. Throw It For a Loop"</a>.</cite>

</li>

<li id="cite_note-28"><a href="#cite_ref-28">^</a> <cite class="citation cs2"><a rel="nofollow" class="external text" href="https://www.gnu.org/software/bash/manual/bash.html#Looping-Constructs-1">"3.2.5.1 Looping Constructs"</a>, <a rel="nofollow" class="external text" href="https://www.gnu.org/software/bash/manual/bash.html">The GNU Bash Reference Manual</a>, 2025-05-18</cite>

</li>

<li id="cite_note-29"><a href="#cite_ref-29">^</a> <cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://langdev.stackexchange.com/questions/1815/how-could-a-language-make-the-loop-and-a-half-less-error-prone/1868#1868">"How could a language make the loop-and-a-half less error-prone?"</a>. Stack Exchange: Programming Language Design and Implementation.</cite>

</li>

<li id="cite_note-30"><a href="#cite_ref-30">^</a> <cite class="citation cs2"><a rel="nofollow" class="external text" href="https://www.gnu.org/software/bash/manual/bash.html#Lists">"3.2.4 Lists of Commands"</a>, <a rel="nofollow" class="external text" href="https://www.gnu.org/software/bash/manual/bash.html">The GNU Bash Reference Manual</a>, 2025-05-18</cite>

</li>

<li id="cite_note-31"><a href="#cite_ref-31">^</a> <cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://stackoverflow.com/questions/52550/what-does-the-comma-operator-do/52615#52615">"What does the comma operator , do?"</a>. <a href="Stack_Overflow" title="Stack Overflow">Stack Overflow</a>.</cite>

</li>

<li id="cite_note-32"><a href="#cite_ref-32">^</a> <cite id="CITEREFMeyer1991" class="citation book cs1">Meyer, Bertrand (1991). Eiffel: The Language. Prentice Hall. pp. 129–131.</cite>

</li>

<li id="cite_note-33"><a href="#cite_ref-33">^</a> <cite class="citation web cs1"><a rel="nofollow" class="external text" href="http://www.lispworks.com/documentation/HyperSpec/Body/m_loop.htm">"Common Lisp LOOP macro"</a>.</cite>

</li>

<li id="cite_note-34"><a href="#cite_ref-34">^</a> <a rel="nofollow" class="external text" href="http://www.sgi.com/tech/stl/for_each.html">for_each</a>. Sgi.com. Retrieved on 2010-11-09.

</li>

<li id="cite_note-35"><a href="#cite_ref-35">^</a> <a rel="nofollow" class="external text" href="https://boost-sandbox.sourceforge.net/libs/foreach/doc/html/">Chapter 1. Boost.Foreach</a> <a rel="nofollow" class="external text" href="https://web.archive.org/web/20100129070613/http://boost-sandbox.sourceforge.net/libs/foreach/doc/html/">Archived</a> 2010-01-29 at the <a href="Wayback_Machine" title="Wayback Machine">Wayback Machine</a>. Boost-sandbox.sourceforge.net (2009-12-19). Retrieved on 2010-11-09.

</li>

<li id="cite_note-36"><a href="#cite_ref-36">^</a> <cite id="CITEREFDavid_Anthony_WattWilliam_Findlay2004" class="citation book cs1">David Anthony Watt; William Findlay (2004). Programming language design concepts. John Wiley & Sons. pp. 221–222. <a href="ISBN_(identifier)" class="mw-redirect" title="ISBN (identifier)">ISBN</a> <bdi>978-0-470-85320-7</bdi>.</cite>

</li>

<li id="cite_note-37"><a href="#cite_ref-37">^</a> <cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://docs.python.org/3/library/asyncio.html">"asyncio — Asynchronous I/O"</a>. Python documentation.</cite>

</li>

<li id="cite_note-38"><a href="#cite_ref-38">^</a> <cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://github.com/socketry/async">"Socketry/Async"</a>. <a href="GitHub" title="GitHub">GitHub</a>. 25 February 2022.</cite>

</li>

<li id="cite_note-39"><a href="#cite_ref-39">^</a> <cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://doc.rust-lang.org/beta/unstable-book/language-features/generators.html">"generators - The Rust Unstable Book"</a>. doc.rust-lang.org.</cite>

</li>

<li id="cite_note-40"><a href="#cite_ref-40">^</a> <cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://docs.rs/corona/0.4.3/corona/">"corona - Rust"</a>. docs.rs.</cite>

</li>

<li id="cite_note-41"><a href="#cite_ref-41">^</a> <cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://rust-lang.github.io/async-book/">"Introduction - Asynchronous Programming in Rust"</a>. rust-lang.github.io.</cite>

</li>

<li id="cite_note-42"><a href="#cite_ref-42">^</a> <cite class="citation web cs1"><a rel="nofollow" class="external text" href="http://storm-enroute.com/coroutines/">"Jitsi Meet"</a>. Storm-enroute.com. Retrieved 2022-09-07.</cite>

</li>

<li id="cite_note-43"><a href="#cite_ref-43">^</a> <a rel="nofollow" class="external text" href="http://www.fortran.com/fortran/come_from.html">We don't know where to GOTO if we don't know where we've COME FROM. This (spoof) linguistic innovation lives up to all expectations.</a> <a rel="nofollow" class="external text" href="https://web.archive.org/web/20180716171336/http://www.fortran.com/fortran/come_from.html">Archived</a> 2018-07-16 at the <a href="Wayback_Machine" title="Wayback Machine">Wayback Machine</a> By R. Lawrence Clark* From Datamation, December, 1973

</li>

<li id="cite_note-44"><a href="#cite_ref-44">^</a> Zahn, C. T. "A control statement for natural top-down structured programming" presented at Symposium on Programming Languages, Paris, 1974.

</li>

<li id="cite_note-45"><a href="#cite_ref-45">^</a> <cite id="CITEREFPayerKuznetsov" class="citation web cs1"><a href="Mathias_Payer" title="Mathias Payer">Payer, Mathias</a>; Kuznetsov, Volodymyr. <a rel="nofollow" class="external text" href="https://nebelwelt.net/blog/20141007-CFICPSCPIdiffs.html">"On differences between the CFI, CPS, and CPI properties"</a>. nebelwelt.net. Retrieved 2016-06-01.</cite>

</li>

<li id="cite_note-46"><a href="#cite_ref-46">^</a> <cite class="citation web cs1"><a rel="nofollow" class="external text" href="http://www.darkreading.com/vulnerabilities---threats/adobe-flash-bug-discovery-leads-to-new-attack-mitigation-method/d/d-id/1323092">"Adobe Flash Bug Discovery Leads To New Attack Mitigation Method"</a>. Dark Reading. 10 November 2015. Retrieved 2016-06-01.</cite>

</li>

<li id="cite_note-47"><a href="#cite_ref-47">^</a> <cite id="CITEREFEndgame" class="citation pressrelease cs1">Endgame. <a rel="nofollow" class="external text" href="http://www.prnewswire.com/news-releases/endgame-to-present-at-black-hat-usa-2016-300267060.html">"Endgame to Present at Black Hat USA 2016"</a>. www.prnewswire.com (Press release). Retrieved 2016-06-01.</cite>

</li>

</ol></div></div>

<div class="mw-heading mw-heading2"><h2 id="Further_reading">Further reading</h2></div>

<ul><li>Hoare, C. A. R. "Partition: Algorithm 63," "Quicksort: Algorithm 64," and "Find: Algorithm 65." Comm. ACM 4, 321–322, 1961.</li></ul>

<div class="mw-heading mw-heading2"><h2 id="External_links">External links</h2></div>

/* start https://en.wikipedia.org/ */

.mw-parser-output .side-box{margin:4px 0;box-sizing:border-box;border:1px solid #aaa;font-size:88%;line-height:1.25em;background-color:var(--background-color-interactive-subtle,#f8f9fa);display:flow-root}.mw-parser-output .infobox .side-box{font-size:100%}.mw-parser-output .side-box-abovebelow,.mw-parser-output .side-box-text{padding:0.25em 0.9em}.mw-parser-output .side-box-image{padding:2px 0 2px 0.9em;text-align:center}.mw-parser-output .side-box-imageright{padding:2px 0.9em 2px 0;text-align:center}@media(min-width:500px){.mw-parser-output .side-box-flex{display:flex;align-items:center}.mw-parser-output .side-box-text{flex:1;min-width:0}}@media(min-width:720px){.mw-parser-output .side-box{width:238px}.mw-parser-output .side-box-right{clear:right;float:right;margin-left:1em}.mw-parser-output .side-box-left{margin-right:1em}}

/* end https://en.wikipedia.org/ */

</style><style data-mw-deduplicate="TemplateStyles:r1237033735">

/* start https://en.wikipedia.org/ */

@media print{body.ns-0 .mw-parser-output .sistersitebox{display:none!important}}@media screen{html.skin-theme-clientpref-night .mw-parser-output .sistersitebox img[src*="Wiktionary-logo-en-v2.svg"]{background-color:white}}@media screen and (prefers-color-scheme:dark){html.skin-theme-clientpref-os .mw-parser-output .sistersitebox img[src*="Wiktionary-logo-en-v2.svg"]{background-color:white}}

/* end https://en.wikipedia.org/ */

</style><div class="side-box side-box-right sistersitebox"><style data-mw-deduplicate="TemplateStyles:r1126788409">

/* start https://en.wikipedia.org/ */

.mw-parser-output .plainlist ol,.mw-parser-output .plainlist ul{line-height:inherit;list-style:none;margin:0;padding:0}.mw-parser-output .plainlist ol li,.mw-parser-output .plainlist ul li{margin-bottom:0}

/* end https://en.wikipedia.org/ */

</style>

<div class="side-box-text plainlist">The Wikibook <a href="https://en.wikibooks.org/wiki/Ada_Programming" class="extiw external" title="wikibooks:Ada Programming">Ada Programming</a> has a page on the topic of: <a href="https://en.wikibooks.org/wiki/Ada_Programming/Control" class="extiw external" title="wikibooks:Ada Programming/Control">Control</a></div></div>

</div>

<div class="side-box-text plainlist">The Wikibook <a href="https://en.wikibooks.org/wiki/Computer_Programming" class="extiw external" title="wikibooks:Computer Programming">Computer Programming</a> has a page on the topic of: <a href="https://en.wikibooks.org/wiki/Computer_Programming/Control" class="extiw external" title="wikibooks:Computer Programming/Control">Control</a></div></div>

</div>

<ul><li> Media related to <a href="https://commons.wikimedia.org/wiki/Category:Control_flow" class="extiw external" title="commons:Category:Control flow">Control flow</a> at Wikimedia Commons</li>

<li><a rel="nofollow" class="external text" href="https://web.archive.org/web/20070703050443/http://www.acm.org/classics/oct95/">Go To Statement Considered Harmful</a></li>

<li><a rel="nofollow" class="external text" href="https://web.archive.org/web/20180716171336/http://www.fortran.com/fortran/come_from.html">A Linguistic Contribution of GOTO-less Programming</a></li>

<li><cite class="citation web cs1"><a rel="nofollow" class="external text" href="https://web.archive.org/web/20090824073244/http://pplab.snu.ac.kr/courses/adv_pl05/papers/p261-knuth.pdf">"Structured Programming with Go To Statements"</a> (PDF). Archived from <a rel="nofollow" class="external text" href="http://pplab.snu.ac.kr/courses/adv_pl05/papers/p261-knuth.pdf">the original</a> (PDF) on 2009-08-24.</cite> (2.88 MB)</li>

<li><cite class="citation web cs1"><a rel="nofollow" class="external text" href="http://www.bitsavers.org/pdf/ibm/704/24-6661-2_704_Manual_1955.pdf">"IBM 704 Manual"</a> (PDF).</cite> (31.4 MB)</li></ul></div><div><div class="zim-footer">

This article is issued from <a class="external text" title="Last edited on 2025-07-31" href="https://en.wikipedia.org/wiki/?title=Control_flow&oldid=1303454048">Wikipedia</a>. The text is available under <a class="external text" href="https://creativecommons.org/licenses/by-sa/4.0/deed.en">Creative Commons Attribution-Share Alike 4.0</a> unless otherwise noted. Additional terms may apply for the media files.

</div>

</div></div>

</div>

</main>

</div>

</body></html>